The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Cycles and p-competition graphs
[article]
2009
arXiv
pre-print
The notion of p-competition graphs of digraphs was introduced by S-R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts [p-competition graphs, Linear Algebra Appl., 217 (1995) 167--178] as a generalization of the competition graphs of digraphs. Let p be a positive integer. The p-competition graph C_p(D) of a digraph D=(V,A) is a (simple undirected) graph which has the same vertex set V and has an edge between distinct vertices x and y if and only if there exist p distinct vertices v_1, ...,
arXiv:0905.3942v1
fatcat:ipjhthblgzf2foonzc2rl2jriu