Characterizations of competition multigraphs

DOI10.1016/J.DAM.2009.04.010MaRDI QIDQ967349zbMATH OpenOpenAlexFDO

Authors Yoshio Sano

Publication date 28 April 2010

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

Full work available at URL https://doi.org/10.1016/j.dam.2009.04.010

zbMATH Keywords

competition graphcompetition hypergrapharbitraru digraphscompetition multigraphedge clique partitionloopless digraphsmulticompetition number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Multicompetition numbers of some multigraphs.
• scientific article; zbMATH DE number 6009
• The double competition multigraph of a digraph
• The Double Multicompetition Number of a Multigraph
• Competition hypergraphs

Cites work

• scientific article; zbMATH DE number 3912431 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 6009 (Why is no real title available?)
• A characterization of competition graphs
• A characterization of competition graphs of arbitrary digraphs
• Competition hypergraphs
• On the Computation of the Competition Number of a Graph

Cited in

(9)

• On competition polysemy and \(m\)-competition polysemy.
• The double competition multigraph of a digraph
• Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs
• The double competition hypergraph of a digraph
• Competition polysemy
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• Competition parameters of a graph
• Multicompetition numbers of some multigraphs.
• Two-\(\phi\)-tolerance competition graphs

This page was built for publication: Characterizations of competition multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967349)