Abstract
Let G be a k-regular graph with girth at least 4, connectivity k, and restricted connectivity 2k-2. We prove in this paper that the edge neighbor connectivity of G×K2 is k. As a consequence, the edge neighbor connectivity of n-dimensional hypercube is n-1. Furthermore, we prove that the edge neighbor connectivity of Kn×K2 is ⌈n/2⌉.
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.
