The competition-common enemy graph of a digraph
From MaRDI portal
The competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosystems. The competition graph essentially relates any two species which have a common prey. In this paper, a competition-common enemy graph of a digraph is defined and studied. As the term suggests, it relates two species which have a common prey and a common enemy. Results analogous to those found for competition graphs are obtained.
Recommendations
Cites work
- A characterization of competition graphs
- A characterization of competition graphs of arbitrary digraphs
- Applications of edge coverings by cliques
- scientific article; zbMATH DE number 3831999 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
Cited in
(41)- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- Niche graphs
- \((i,j)\) competition graphs
- Competition numbers of graphs with a small number of triangles
- The \(m\)-step competition graph of a digraph
- \(p\)-competition graphs
- Competition polysemy
- Any complete preference structure without circuit admits an interval representation
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
- Competition graphs under complex Pythagorean fuzzy information
- Phylogeny numbers of generalized Hamming graphs
- The niche graphs of bipartite tournaments
- Niche hypergraphs of products of digraphs
- m-step fuzzy competition graphs
- On \((1, 2)\)-step competition graphs of bipartite tournaments
- The m-step competition graphs of doubly partial orders
- The competition hypergraphs of doubly partial orders
- The niche graphs of interval orders
- The \(m\)-step, same-step, and any-step competition graphs
- The competition number of a graph having exactly one hole
- The competition-common enemy graphs of digraphs satisfying Conditions C(p) and C'(p)
- Intuitionistic fuzzy competition graphs
- Niche hypergraphs
- On strict-double-bound numbers of caterpillars
- scientific article; zbMATH DE number 4149959 (Why is no real title available?)
- scientific article; zbMATH DE number 4063115 (Why is no real title available?)
- scientific article; zbMATH DE number 4095502 (Why is no real title available?)
- Competition graphs and clique dimensions
- scientific article; zbMATH DE number 1161365 (Why is no real title available?)
- The double competition hypergraph of a digraph
- On strict-double-bound numbers of graphs and cut sets
- Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs
- Note on strict-double-bound numbers of nearly complete graphs missing some edges
- On strict-double-bound graphs and Cartesian products of paths and cycles
- p-competition numbers
- The niche graphs of multipartite tournaments
- m-step inverse fuzzy mixed competition graphs
- The double competition number of some triangle-free graphs
- On CCE graphs of doubly partial orders
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
This page was built for publication: The competition-common enemy graph of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086581)
