Abstract
Given a graph G=( V, E), HCN( L( G)) is the minimum number of edges to be added to its line graph L( G) to make L( G) Hamiltonian. This problem is known to be NP-hard for general graphs, whereas a O(| V|) algorithm exists when G is a tree. In this paper a linear algorithm for finding HCN( L( G)) when G is a cactus is proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
