New bounds on the diameter vulnerability of iterated line digraphs

DOI10.1016/S0012-365X(00)00230-2zbMath0982.05063WikidataQ128109407 ScholiaQ128109407MaRDI QIDQ5936021

Daniela Ferrero, Carles Padró

Publication date: 29 March 2002

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

zbMATH Keywords

diameterline digraphvulnerability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Connectivity and fault-tolerance of hyperdigraphs, On the \((h,k)\)-domination numbers of iterated line digraphs, On large (Δ, D, D, 1)-graphs