Abstract
In this note, we give a simpler proof of a theorem of Desormeaux et al., which states that for any connected graph G containing a cycle, γc(G)≥g(G)−2, where γc(G) and g(G) are the connected domination number and the girth of G respectively. This enables us to confirm a conjecture of Walsh: for any connected nontree graph G, h(G)≥g(G)−3, where h(G) is the hub number of G. We also determine the connected domination number and the connected hub number of Mycielski graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.