Domination number in graphs with minimum degree two

DOI10.1007/s10114-009-7617-6zbMath1210.05103MaRDI QIDQ839753

Moo Young Sohn, Xu Dong Yuan, Erfang Shan, Michael A. Henning

Publication date: 3 September 2009

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-009-7617-6

zbMATH Keywords

graph; dominating set; domination number; restricted domination number

Mathematics Subject Classification ID

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

05C07: Vertex degrees

Related Items

A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\), New results on \(k\)-independence of graphs, Labelings of plane graphs containing Hamilton path, Super \(d\)-antimagic labelings of disconnected plane graphs, Domination numbers of undirected toroidal mesh, The limit case of a domination property, Strong labelings of linear forests, Unions of digraphs which become kernel perfect, Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the domination number of a graph with minimum degree 2
• Restricted domination in graphs
• Domination in graphs of minimum degree five
• Domination in graphs with minimum degree two
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Paths, Stars and the Number Three