\(p\)-competition graphs

DOI10.1016/0024-3795(94)00060-QzbMath0824.05027OpenAlexW2066793592MaRDI QIDQ1805319

Terry A. McKee, Suh-Ryung Kim, Fred R. McMorris, Fred S. Roberts

Publication date: 12 June 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00060-q

zbMATH Keywords

digraphcompetition graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (18)

Oligopolistic competition among the wireless Internet service providers of Malaysia using fuzzy soft graphs ⋮ Intuitionistic fuzzy competition graphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ The niche graphs of bipartite tournaments ⋮ Competition graphs under interval-valued \(m\)-polar fuzzy environment and its application ⋮ Analysis of the effect of medicines over bacteria based on competition graphs with picture fuzzy environment ⋮ Fuzzy \(\phi\)-tolerance competition graphs ⋮ Iterated open neighborhood graphs and generalizations ⋮ Note on p-competition graphs of spiders ⋮ \(p\)-competition numbers ⋮ Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs ⋮ Competition graphs under complex Pythagorean fuzzy information ⋮ Unnamed Item ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ The \(m\)-step competition graph of a digraph ⋮ The \(m\)-step, same-step, and any-step competition graphs ⋮ \(m\)-step fuzzy competition graphs ⋮ New concepts of vague competition graphs

Cites Work

• \(p\)-competition numbers
• Some recent results on niche graphs
• The double competition number of some triangle-free graphs
• Applications of edge coverings by cliques
• On rigid circuit graphs
• Some uniqueness results for upper bound graphs
• 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
• Niche graphs
• \((i,j)\) competition graphs
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• Competition graphs and clique dimensions
• General results on tolerance intersection graphs
• Niche numbers
• 2-Competition Graphs
• On the p-Edge Clique over Nuber of Complete Bipartite Graphs
• The 2‐intersection number of paths and bounded‐degree trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(p\)-competition graphs