On domination in Hamiltonian cubic graphs

MaRDI QIDQ5754608zbMATH OpenFDO

Authors Doost Ali Mojdeh, Seyed Ahmad Hassanpour, A. Ahmadi Haji, H. Abdollahzadeh Ahangar

Publication date 23 August 2007

zbMATH Keywords

Cartesian product of graphscomposition of graphsconvex setsgeodesic path convexity

Mathematics Subject Classification ID

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

Recommendations

• The domination number of cubic Hamiltonian graphs
• Total domination versus domination in cubic graphs
• Domination versus independent domination in cubic graphs
• Dominating and total dominating partitions in cubic graphs
• The independent domination number of a cubic 3-connected graph can be much larger than its domination number

Cited in

(9)

• On (1,2)-domination in cubic graphs
• The domination number of cubic Hamiltonian graphs
• The forcing domination number of Hamiltonian cubic graphs
• scientific article; zbMATH DE number 15376 (Why is no real title available?)
• scientific article; zbMATH DE number 2149826 (Why is no real title available?)
• Acyclic total dominating sets in cubic graphs
• Domination mappings into the Hamming ball: existence, constructions, and algorithms
• Dominating and total dominating partitions in cubic graphs
• On the domination number of Hamiltonian graphs with minimum degree six

This page was built for publication: On domination in Hamiltonian cubic graphs

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