Blake, Heather Smith scite author profile

The dominating graph of a graph G has as its vertices all dominating sets of G, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of G. In this paper we prove that the dominating graph of any tree has a Hamilton path. We also prove that the dominating graph of a cycle on n vertices has a Hamilton path if and only if n ≡ 0 (mod 4).

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Blake, Heather Smith

Hamilton Paths in Dominating Graphs of Trees and Cycles

Trees in Many Contexts

Hamilton Paths in Dominating Graphs of Trees and Cycles

Contact Info

Product

Resources

About