The competition numbers of Johnson graphs

DOI10.7151/DMGT.1506zbMATH Open1217.05180OpenAlexW2139439872MaRDI QIDQ2997604FDOQ2997604

Authors: Suh-Ryung Kim, Boram Park, Yoshio Sano 

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1506

Recommendations

• The competition numbers of Johnson graphs with diameter four
• The competition numbers of Hamming graphs with diameter at most three
• scientific article; zbMATH DE number 434915
• Competition numbers of graphs with a small number of triangles
• The competition number of a graph with exactly two holes

zbMATH Keywords

competition graphJohnson graphcompetition numberedge clique cover

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Cited In (4)

• The competition number of the complement of a cycle
• The competition numbers of Johnson graphs with diameter four
• The competition numbers of ternary Hamming graphs
• A generalization of Opsut's lower bounds for the competition number of a graph

This page was built for publication: The competition numbers of Johnson graphs

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