Abstract
It is well known that the edge-connectivity of a simple, connected, vertex transitive graph attains its regular degree. It is then natural to consider the relationship between the graph’s edge connectivity and the number of orbits of its automorphism group. In [6], Liu and Meng (2008) studied the edge connectivity of regular double-orbits graphs. Later, Lin et al. (in press) [10] characterized the λ′-optimal 3-regular double-orbit graph and given a sufficient condition for the k-regular double-orbit graphs to be optimal. In this note, we characterize the super restricted edge connected k-regular double-orbit graphs with grith at least 6.
Sign-in/Register to access full text options 
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.
