AbstractThe competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ecosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we define and study the m-step competition graph of a digraph which is another generalization of competition graph
AbstractThe competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosys...
AbstractThe notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. ...
Originally derived from the idea of food webs of predator and prey, the relationship between digraph...
AbstractThe competition graph of a digraph was introduced by Cohen in 1968 associated with the study...
AbstractThe competition graph and its generalizations have interested graph theorists for over 30 ye...
AbstractIn 1968, Cohen presented competition graphs in connection with the study of ecological syste...
AbstractIn 2000 Cho, Kim and Nam proved that Pn, the path on n vertices, is a 2-step competition gra...
The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More ...
AbstractSince Cohen introduced the competition graph in 1968, the competition graph has been studied...
In this paper, we completely characterize the digraphs of order $n$ whose $m$-step competition graph...
AbstractThe competition graph of a digraph, introduced by Cohen in 1968, has been extensively studie...
AbstractFor positive integers k and m, and a digraph D, the k-step m-competition graph Cmk(D) of D h...
AbstractThe competition graph of a doubly partial order is an interval graph. The competition-common...
Graph theory is a useful tool for studying systems of food webs, a concept from ecology that models ...
AbstractIf D = (V, A) is a digraph, its p-competition graph has vertex set V and an edge between x a...
AbstractThe competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosys...
AbstractThe notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. ...
Originally derived from the idea of food webs of predator and prey, the relationship between digraph...
AbstractThe competition graph of a digraph was introduced by Cohen in 1968 associated with the study...
AbstractThe competition graph and its generalizations have interested graph theorists for over 30 ye...
AbstractIn 1968, Cohen presented competition graphs in connection with the study of ecological syste...
AbstractIn 2000 Cho, Kim and Nam proved that Pn, the path on n vertices, is a 2-step competition gra...
The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More ...
AbstractSince Cohen introduced the competition graph in 1968, the competition graph has been studied...
In this paper, we completely characterize the digraphs of order $n$ whose $m$-step competition graph...
AbstractThe competition graph of a digraph, introduced by Cohen in 1968, has been extensively studie...
AbstractFor positive integers k and m, and a digraph D, the k-step m-competition graph Cmk(D) of D h...
AbstractThe competition graph of a doubly partial order is an interval graph. The competition-common...
Graph theory is a useful tool for studying systems of food webs, a concept from ecology that models ...
AbstractIf D = (V, A) is a digraph, its p-competition graph has vertex set V and an edge between x a...
AbstractThe competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosys...
AbstractThe notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. ...
Originally derived from the idea of food webs of predator and prey, the relationship between digraph...
DOI
Add to ORKG