Title of article
The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract)
Author/Authors
Wang، نويسنده , , Shiying and Lin، نويسنده , , Shangwei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
49
To page
53
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.
Keywords
Kautz undirected graphs , restricted edge connectivity , maximal restricted edge connectivity
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454084
Link To Document