Domination number in 4-regular graphs

MaRDI QIDQ3013510zbMATH OpenFDO

Authors H. Abdollahzadeh Ahangar, L. Pushpalatha

Publication date 18 July 2011

zbMATH Keywords

Hamiltonian graphregular graphSmarandachely \(k\)-dominating set

Mathematics Subject Classification ID

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

Recommendations

• On Domination Number of 4-Regular Graphs
• The forcing domination number of Hamiltonian cubic graphs
• Domination in 4-regular graphs with girth 3
• Domination versus independent domination in graphs of small regularity
• On independent domination of regular graphs

Cited in

(7)

• Domination in 4-regular Knödel graphs
• On the graphs with four distinct domination roots
• On Domination Number of 4-Regular Graphs
• The forcing domination number of Hamiltonian cubic graphs
• Secure domination in 4-regular planar and non-planar graph with girth 3
• Computation of captive, half certified and majority domination numbers of a family of 3-regular graphs
• Domination in 4-regular graphs with girth 3

This page was built for publication: Domination number in 4-regular graphs

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