Remarks on the domination number of graphs

MaRDI QIDQ2910020zbMATH OpenFDO

Authors Csaba Biró, Éva Czabarka, Peter Dankelmann, László A. Székely

Publication date 7 September 2012

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

chromatic numberdegree-regular graphsdomination numberKneser graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 1472173
• An upper bound for domination number of 5-regular graphs
• Bounds on the domination number of Kneser graphs
• Domination versus independent domination in graphs of small regularity
• scientific article; zbMATH DE number 2192159

Cited in

(10)

• A comment to: Two classes of edge domination in graphs
• Domination number of graphs with minimum degree five
• A note on the domination number of a graph and its complement
• Improved upper bounds on the domination number of graphs with minimum degree at least five
• Bounds on the domination number of Kneser graphs
• scientific article; zbMATH DE number 5543109 (Why is no real title available?)
• scientific article; zbMATH DE number 5642607 (Why is no real title available?)
• Note on the domination unmber of a graph
• Domination versus disjunctive domination in graphs
• scientific article; zbMATH DE number 7693193 (Why is no real title available?)

This page was built for publication: Remarks on the domination number of graphs

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