Domination number in graphs with minimum degree two

DOI10.1007/S10114-009-7617-6MaRDI QIDQ839753zbMATH OpenOpenAlexFDO

Authors Erfang Shan, Moo Young Sohn, Xudong Yuan, 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

graphdomination numberdominating setrestricted domination number

Mathematics Subject Classification ID

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

Recommendations

• Bounds related to domination in graphs with minimum degree two
• Restricted domination in graphs with minimum degree 2
• An upper bound on the domination number of a graph with minimum degree 2
• Domination in partitioned graphs with minimum degree two
• Restricted total domination in graphs with minimum degree two
• A new bound on the domination number of graphs with minimum degree two
• Domination in graphs of minimum degree at least two and large girth
• Restrained domination in graphs with minimum degree two
• Stratification and domination in graphs with minimum degree two

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• An upper bound on the domination number of a graph with minimum degree 2
• Bounds related to domination in graphs with minimum degree two
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Domination in graphs of minimum degree five
• Domination in graphs with minimum degree two
• Paths, Stars and the Number Three
• Restricted domination in graphs

Cited in

(19)

• Restricted total domination in graphs with minimum degree two
• A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)
• Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
• Domination number of graphs with minimum degree five
• An upper bound on the domination number of a graph with minimum degree 2
• Strong labelings of linear forests
• Labelings of plane graphs containing Hamilton path
• Unions of digraphs which become kernel perfect
• Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
• On a relationship between 2-dominating and 5-dominating sets in graphs
• Domination in graphs with minimum degree two
• DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
• Domination numbers of undirected toroidal mesh
• The limit case of a domination property
• A new bound on the domination number of graphs with minimum degree two
• Super \(d\)-antimagic labelings of disconnected plane graphs
• New results on \(k\)-independence of graphs
• 2-connected graphs with small 2-connected dominating sets.
• Domination in graphs of minimum degree five

This page was built for publication: Domination number in graphs with minimum degree two

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