Domination number of graphs without small cycles

DOI10.1007/S00373-010-1004-ZMaRDI QIDQ659744zbMATH OpenOpenAlexFDO

Authors Xuegang Chen, Moo Young Sohn

Publication date 24 January 2012

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-1004-z

zbMATH Keywords

boundsdomination numberminimum degree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
• Domination in bipartite graphs
• Domination number of graphs with minimum degree five
• Domination in graphs of minimum degree at least two and large girth
• scientific article; zbMATH DE number 2235063

Cites work

• A Winning Strategy for the Ramsey Graph Game
• Domination in bipartite graphs
• Domination in graphs with minimum degree two
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)

Cited in

(4)

• On the 2-domination Number of Cylinders with Small Cycles
• Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
• New results on the 1-isolation number of graphs without short cycles
• Domination in bipartite graphs

This page was built for publication: Domination number of graphs without small cycles

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