Domination number of graphs without small cycles

DOI10.1007/S00373-010-1004-ZzbMATH Open1234.05175OpenAlexW2025430489MaRDI QIDQ659744FDOQ659744

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

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

zbMATH Keywords

domination numberminimum degreebounds

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination in graphs with minimum degree two
• A Winning Strategy for the Ramsey Graph Game
• Domination in bipartite graphs

Cited In (2)

• On the 2-domination Number of Cylinders with Small 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)