On the domination number of Hamiltonian graphs with minimum degree six

DOI10.1016/J.AML.2007.10.023zbMath1160.05326OpenAlexW2020817295MaRDI QIDQ952720

Andrew R. Plummer, Johannes H. Hattingh, Hua-Ming Xing

Publication date: 14 November 2008

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.10.023

zbMATH Keywords

Hamiltonian graphdominating setdomination numberdegree six

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• 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

This page was built for publication: On the domination number of Hamiltonian graphs with minimum degree six