p-competition graphs Original Research Article

If D = (V, A) is a digraph, its p-competition graph has vertex set Vand an edge between x and y if and only if there are distinct vertices a1, …, ap and arcs (x, ai) and (y, ai) in D for each i ≤ p. This definition generalizes the widely studied p = 1 case of ordinary competition graphs. We obtain results about p-competition graphs analogous to the well-known results about ordinary competition graphs and apply these results to specific cases.