Niche graphs

DOI10.1016/0166-218X(89)90015-2zbMath0677.05039OpenAlexW2911899363MaRDI QIDQ1123204

Suzanne M. Seager, J. Richard Lundgren, Kathryn Fraughnaugh Jones, Charles A. Cable

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90015-2

zbMATH Keywords

competition graphacyclic digraphniche numberniche graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (24)

Niche number four ⋮ 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 ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ The niche graphs of bipartite tournaments ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ Fuzzy \(\phi\)-tolerance competition graphs ⋮ The competition hypergraphs of doubly partial orders ⋮ The niche graphs of interval orders ⋮ \((i,j)\) competition graphs ⋮ \(p\)-competition numbers ⋮ Niche hypergraphs of products of digraphs ⋮ Loop and cyclic niche graphs ⋮ \(p\)-competition graphs ⋮ Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs ⋮ Some recent results on niche graphs ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Phylogeny numbers of generalized Hamming graphs ⋮ The \(m\)-step competition graph of a digraph ⋮ The competition number of a graph having exactly one hole ⋮ \(m\)-step fuzzy competition graphs ⋮ The smallest graphs with niche number three

Cites Work

• Applications of edge coverings by cliques
• Inverting graphs of rectangular matrices
• A characterization of competition graphs
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• The competition-common enemy graph of a digraph
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Niche graphs