Abstract
The double-orbit graph is a generalization of vertex transitive graphs, which contains many classic network models. Conditional edge-connectivity is an important index to measure the fault-tolerance and reliability of the networks. In this paper, we characterize the super-?(2) double-orbit graphs with two orbits of the same size. Moreover, we give a sufficient condition for regular double-orbit graphs to be ?(3)-optimal, and characterize super- ?(3) regular double-orbit graphs.
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.
