scientific article; zbMATH DE number 3993639
From MaRDI portal
Publication:4722110
The authors characterize graphs with the property \(d(G)=d(K(G))+\varepsilon\), for \(\varepsilon =-1,0,1\), where \(d(G)\) is the diameter and \(K(G)\) the clique graph of a graph \(G\). In addition, they show examples of graphs with the property \(d(G)+2=d(K(K(G)))\) answering by this in the affirmative a question of Hedman. A construction of self-clique graphs (i.e., \(G=K(G))\) is also given.
Recommendations
Cited in
(21)- On expansive graphs
- The complexity of clique graph recognition
- On self-clique graphs with given clique sizes. II
- Clique divergent graphs with unbounded sequence of diameters
- A hierarchy of self-clique graphs
- Distances and diameters on iterated clique graphs
- On the radius and diameter of the clique graph
- On hereditary clique-Helly self-clique graphs
- Self-clique Helly circular-arc graphs
- On self-clique shoal graphs
- Distances and diameters on iterated clique graphs
- A sufficient condition for self-clique graphs
- On second iterated clique graphs that are also third iterated clique graphs
- Diameters of iterated clique graphs of chordal graphs
- scientific article; zbMATH DE number 4049680 (Why is no real title available?)
- scientific article; zbMATH DE number 1286517 (Why is no real title available?)
- Self‐clique graphs and matrix permutations
- Structural properties of biclique graphs and the distance formula
- Clique graphs and Helly graphs
- On self-clique graphs with triangular cliques
- An infinite family of self-diclique digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722110)