Diameter in iterated path graphs

DOI10.1016/S0012-365X(00)00234-XMaRDI QIDQ5936025zbMATH OpenOpenAlexFDO

Authors Martin Knor, Ludovit 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

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

Recommendations

• scientific article; zbMATH DE number 1332354
• The dynamics of the line and path graph operators
• scientific article; zbMATH DE number 1842917
• scientific article; zbMATH DE number 1109402
• scientific article; zbMATH DE number 1286517

Cited in

(13)

• Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
• Edge-connectivity in \(P_k\)-path graphs
• A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
• Diameters of iterated clique graphs of chordal graphs
• Histories in Path Graphs
• scientific article; zbMATH DE number 4049680 (Why is no real title available?)
• scientific article; zbMATH DE number 1332354 (Why is no real title available?)
• scientific article; zbMATH DE number 1472184 (Why is no real title available?)
• Diameter of path graphs
• Histories in path graphs
• scientific article; zbMATH DE number 5248920 (Why is no real title available?)
• Histories of iterated path graphs
• Some new properties of certain path graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936025)