Super edge-connectivity of de Bruijn and Kautz undirected graphs

DOI10.1007/s11766-004-0011-3zbMath1059.05067OpenAlexW2017963905WikidataQ126211421 ScholiaQ126211421MaRDI QIDQ1769572

Yingmei Fan, Jun-Ming Xu

Publication date: 4 April 2005

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-004-0011-3

zbMATH Keywords

de Bruijn graphsKautz graphssuper edge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Kautz networks
• On computing a conditional edge-connectivity of a graph
• Super edge-connectivity of dense digraphs and graphs
• Refined connectivity properties of abelian Cayley graphs
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Complexity of network reliability computations
• Maximally connected digraphs

This page was built for publication: Super edge-connectivity of de Bruijn and Kautz undirected graphs