The competition-common enemy graph of a digraph
From MaRDI portal
Publication:1086581
DOI10.1016/0166-218X(87)90030-8zbMath0609.05038OpenAlexW2067154029MaRDI QIDQ1086581
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(87)90030-8
Related Items (33)
Competition graphs and clique dimensions ⋮ On strict-double-bound numbers of caterpillars ⋮ On strict-double-bound numbers of graphs and cut sets ⋮ Intuitionistic fuzzy competition graphs ⋮ Niche hypergraphs ⋮ Any complete preference structure without circuit admits an interval representation ⋮ Competition numbers of graphs with a small number of triangles ⋮ Niche graphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On CCE graphs of doubly partial orders ⋮ The niche graphs of bipartite tournaments ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ The competition hypergraphs of doubly partial orders ⋮ The niche graphs of interval orders ⋮ Note on strict-double-bound numbers of nearly complete graphs missing some edges ⋮ \((i,j)\) competition graphs ⋮ The double competition hypergraph of a digraph ⋮ \(p\)-competition numbers ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ Niche hypergraphs of products of digraphs ⋮ \(p\)-competition graphs ⋮ Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs ⋮ Competition graphs under complex Pythagorean fuzzy information ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two ⋮ The double competition number of some triangle-free graphs ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Competition polysemy ⋮ Phylogeny numbers of generalized Hamming graphs ⋮ The \(m\)-step competition graph of a digraph ⋮ The \(m\)-step, same-step, and any-step competition graphs ⋮ The competition number of a graph having exactly one hole ⋮ \(m\)-step fuzzy competition graphs
Cites Work
This page was built for publication: The competition-common enemy graph of a digraph
