Abstract
The Kautz graphs are a famous class of network models and the super-λ property of graphs is a good indicator of the fault tolerance of networks. We, in this paper, study mainly the conditional arc connectivity and super-λ tolerance to arc-faults of digraphs, which are two measurements of super-λ property. We first give some bounds on them in terms of minimum degree of digraphs, and then determine them for Kautz digraphs. The obtained results show that the fault tolerance of Kautz networks is nice.
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.
