Connectivity of iterated line graphs

DOI10.1016/S0166-218X(02)00197-XzbMath1009.05086OpenAlexW2159159820MaRDI QIDQ5917466

Martin Knor, L'udovít Niepel

Publication date: 9 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00197-x

zbMATH Keywords

line graphedge-connectivityvertex-connectivitygraph dynamics

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (16)

Edge-connectivity in \(P_k\)-path graphs ⋮ Index of parameters of iterated line graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ \(s\)-vertex pancyclic index ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ Spanning 3-connected index of graphs ⋮ On average connectivity of the strong product of graphs ⋮ Connectivity of iterated line graphs ⋮ Nonplanarity of iterated line graphs ⋮ Linkability in iterated line graphs ⋮ The Wiener index in iterated line graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ ON GROWTH TRIANGULAR GRAPHS ⋮ Diameter and connectivity of 3-arc graphs ⋮ On the dominating (induced) cycles of iterated line graphs

Cites Work

• Maximum degree growth of the iterated line graph
• Parallel concepts in graph theory
• Hamiltonian iterated line graphs
• The connectivity of line-graphs
• Maximally connected digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity of iterated line graphs