Diameter vulnerability of iterated line digraphs

DOI10.1016/0012-365X(96)83094-9zbMath0844.05045MaRDI QIDQ1910577

Carles Padró, Paz Morillo

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphdiameterline digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Spanners of underlying graphs of iterated line digraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ On large (Δ, D, D, 1)-graphs ⋮ Disjoint paths of bounded length in large generalized cycles

Cites Work

• Large fault-tolerant interconnection networks
• Diameter-vulnerability of large bipartite digraphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of Imase and Itoh digraphs
• Maximally connected digraphs
• Dense bipartite digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameter vulnerability of iterated line digraphs