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.











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)