Diameter in iterated path graphs

DOI10.1016/S0012-365X(00)00234-XzbMath0989.05036OpenAlexW2019129367MaRDI QIDQ5936025

Martin Knor, L'udovít Niepel

Publication date: 2 July 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00234-x

zbMATH Keywords

diameterline graphpath graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (5)

Edge-connectivity in \(P_k\)-path graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ Diameter of path graphs ⋮ Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs ⋮ Histories in Path Graphs

This page was built for publication: Diameter in iterated path graphs