Diameter vulnerability of iterated line digraphs in terms of the girth

DOI10.1002/net.20049zbMath1067.68099OpenAlexW4241619143MaRDI QIDQ4667713

Camino Balbuena, Daniela Ferrero, Xavier Marcote

Publication date: 21 April 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20049

zbMATH Keywords

girthKautz digraphdiameter vulnerabilitydeBruijn digraphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ On large (Δ, D, D, 1)-graphs

Cites Work

• Disjoint paths of bounded length in large generalized cycles

This page was built for publication: Diameter vulnerability of iterated line digraphs in terms of the girth