Clique divergent graphs with unbounded sequence of diameters
The clique graph \(kG\) of a graph \(G\) is the intersection graph of the family of all maximal complete subgraphs of \(G\). The iterated clique graphs \(k^nG\) are defined by \(k^0G= G\) and \(k^{n+1}G= kk^nG\). A graph \(G\) is said to be \(k\)-divergent if the order of \(k^nG\) tends to infinity with \(n\). The authors provide examples of \(k\)-divergent graphs such that the diameters of the iterated clique graphs also tend to infinity with \(n\). Furthermore, the sizes of the cliques and the chromatic numbers remain bounded.
- scientific article; zbMATH DE number 4049680
- scientific article; zbMATH DE number 1286517
- On iterated clique graphs with increasing diameters
- Diameters of iterated clique graphs of chordal graphs
- On clique divergent graphs with linear growth
- Clique divergent clockwork graphs and partial orders
- Clique divergent clockwork graphs and partial orders
- A family of clique divergent graphs with linear growth
- Distances and diameters on iterated clique graphs
- Distances and diameters on iterated clique graphs
- A common generalization of line graphs and clique graphs
- A family of clique divergent graphs with linear growth
- Clique graphs and Helly graphs
- Clique graphs of time graphs
- Convergence of iterated clique graphs
- Diameters of iterated clique graphs of chordal graphs
- scientific article; zbMATH DE number 3829965 (Why is no real title available?)
- scientific article; zbMATH DE number 4049680 (Why is no real title available?)
- scientific article; zbMATH DE number 3773651 (Why is no real title available?)
- scientific article; zbMATH DE number 3641500 (Why is no real title available?)
- scientific article; zbMATH DE number 3993639 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- scientific article; zbMATH DE number 3402664 (Why is no real title available?)
- On clique-critical graphs
- On iterated clique graphs with increasing diameters
- Parallel concepts in graph theory
- Squares, clique graphs, and chordality
- Sur le coloriage des graphs
- Über iterierte Clique-Graphen
- On expansive graphs
- On clique divergent graphs with linear growth
- A family of clique divergent graphs with linear growth
- The clique operator on cographs and serial graphs
- Clique divergent clockwork graphs and partial orders
- Distances and diameters on iterated clique graphs
- The icosahedron is clique divergent
- Iterated clique graphs and bordered compact surfaces
- Locally \(C_6\) graphs are clique divergent
- On the iterated edge-biclique operator
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
- On the clique behavior of graphs of low degree
- Edge contraction and edge removal on iterated clique graphs
- A new family of expansive graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Distances and diameters on iterated clique graphs
- On the clique behavior of circulants with three small jumps
- On the iterated biclique operator
- Clique-divergence is not first-order expressible for the class of finite graphs.
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Diclique digraphs
- The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- Almost every graph is divergent under the biclique operator
This page was built for publication: Clique divergent graphs with unbounded sequence of diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292855)
