Distances and diameters on iterated clique graphs

DOI10.1016/S0166-218X(03)00379-2zbMath1043.05042OpenAlexW2055355518MaRDI QIDQ1827868

Miguel A. Pizaña

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00379-2

zbMATH Keywords

Johnson graphsDistancesDiametersIterated clique graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (5)

Edge contraction and edge removal on iterated clique graphs ⋮ Unnamed Item ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ The complexity of clique graph recognition ⋮ Cube intersection concepts in median graphs

Cites Work

• A new infinite series of regular uniformly geodetic code graphs
• Clique graphs of time graphs
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• Clique divergent graphs with unbounded sequence of diameters
• A characterization of Grassmann and Johnson graphs
• The icosahedron is clique divergent
• On clique convergent graphs
• Locally \(C_6\) graphs are clique divergent
• On iterated clique graphs with increasing diameters
• Locally 4‐by‐4 grid graphs
• The Johnson graphs satisfy a distance extension property
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distances and diameters on iterated clique graphs