Article ID Journal Published Year Pages File Type
9514526 Electronic Notes in Discrete Mathematics 2005 5 Pages PDF
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 UK(d,n) is 4d−4, and UK(d,n) is a maximal restricted edge connected graph.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The maximal restricted edge connectivity of Kautz undirected graphs
Authors
, ,