AbstractIf D = (V, A) is a digraph, its p-competition graph has vertex set V and 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
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
AbstractIf D = (V, A) is a digraph, its p-competition graph has vertex set V and an edge between x a...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
Abstract. IfD (V, A) is a digraph, its p-competition graph forp a positive integer has vertex set Va...
AbstractIf D is an acyclic digraph, its competition graph has the same vertex set as D and an edge b...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
. Given a digraph D, we construct the competition graph of D, C(D), on the same vertex set as D with...
If D is an acyclic digraph, its competition graph has the same vertex set as D and an edge between v...
Abstract. Competition graphs were rst introduced by Joel Cohen in the study of food webs and have si...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractThe competition graph of a digraph, introduced by Cohen in 1968, has been extensively studie...
The competition graph C(D) of a digraph D is the graph on the same vertex set as D with an edge betw...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
AbstractIf D = (V, A) is a digraph, its p-competition graph has vertex set V and an edge between x a...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
Abstract. IfD (V, A) is a digraph, its p-competition graph forp a positive integer has vertex set Va...
AbstractIf D is an acyclic digraph, its competition graph has the same vertex set as D and an edge b...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
. Given a digraph D, we construct the competition graph of D, C(D), on the same vertex set as D with...
If D is an acyclic digraph, its competition graph has the same vertex set as D and an edge between v...
Abstract. Competition graphs were rst introduced by Joel Cohen in the study of food webs and have si...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractThe competition graph of a digraph, introduced by Cohen in 1968, has been extensively studie...
The competition graph C(D) of a digraph D is the graph on the same vertex set as D with an edge betw...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
DOI
Add to ORKG