scientific article; zbMATH DE number 4110714

MaRDI QIDQ3834069zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

diameterdigraphKautz graphsvulnerability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Diameter vulnerability of iterated line digraphs
• On the diameter vulnerability of Kautz digraphs
• Diameter vulnerability of graphs
• scientific article; zbMATH DE number 3908346
• Asymptotically optimal (, D', s)-digraphs

Cited in

(15)

• On 3-restricted edge connectivity of undirected binary Kautz graphs
• Large fault-tolerant interconnection networks
• Fault-tolerant routings in Kautz and de Bruijn networks
• Vulnerability in graphs of diameter four
• Diameter vulnerability of GC graphs
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• Restricted fault diameter of hypercube networks
• Diameter vulnerability of iterated line digraphs
• On the diameter vulnerability of Kautz digraphs
• Diameter-vulnerability of large bipartite digraphs
• On large ( , D, D, 1)-graphs
• scientific article; zbMATH DE number 3908346 (Why is no real title available?)
• scientific article; zbMATH DE number 1735721 (Why is no real title available?)
• Connectivity of Kautz networks
• Diameter vulnerability of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834069)