Abstract
Abstract The restricted edge connectivity is an accurate measure of fault-tolerance for interconnection networks. In this paper, we obtain the following: for d ≥ 3 , n ≥ 2 , the restricted edge connectivity of Kautz undirected graph U K ( d , n ) is 4 d − 4 , and U K ( d , n ) is a maximal restricted edge connected graph.
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.
