Abstract
The edge connectivity is a kind of classic measure of fault tolerance of networks. 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 edge connectivity and the number of orbits of its automorphism group. The double-orbit graphs with two orbits of the same size is a generalization of vertex transitive networks, which contains several classic network models. In this note, we obtain a sufficient condition for such double-orbit graphs to be super-λ′.
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.
