Note on the connectivity of line graphs

DOI10.1016/j.ipl.2004.03.013zbMath1178.68088OpenAlexW2054648440MaRDI QIDQ2390273

Dieter Rautenbach, Angelika Hellwig, Lutz Volkmann

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.013

zbMATH Keywords

connectivityfault toleranceline graphsrestricted edge-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (7)

Fault-tolerant analysis of a class of networks ⋮ On reliability of the folded hypercubes ⋮ Completely independent spanning trees in line graphs ⋮ Super-connected but not super edge-connected graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ The existence and upper bound for two types of restricted connectivity ⋮ Super connectivity of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing a conditional edge-connectivity of a graph
• On a kind of restricted edge connectivity of graphs
• Cuts leaving components of given minimum order
• Edge-cuts leaving components of order at least three
• The connectivity of line-graphs
• Lower-bounds on the connectivities of a graph

This page was built for publication: Note on the connectivity of line graphs