Locally \(C_6\) graphs are clique divergent

DOI10.1016/S0012-365X(99)00233-2zbMath0961.05056OpenAlexW2020792090WikidataQ127016048 ScholiaQ127016048MaRDI QIDQ1974531

F. Larrión, Víctor Neumann-Lara

Publication date: 28 May 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00233-2

zbMATH Keywords

clique numberclique graphdiameterscovering graphsclique divergence

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (23)

On self-clique shoal graphs ⋮ 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 ⋮ Unnamed Item ⋮ On strong graph bundles ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Iterated Clique Graphs and Contractibility ⋮ The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence ⋮ Almost every graph is divergent under the biclique operator ⋮ Equivariant collapses and the homotopy type of iterated clique graphs ⋮ Contractibility and the clique graph operator ⋮ On the Iterated Biclique Operator ⋮ A new family of expansive graphs ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ The clique operator on matching and chessboard graphs ⋮ On expansive graphs ⋮ The fundamental group of the clique graph ⋮ Locally grid graphs: Classification and Tutte uniqueness ⋮ The clique operator on cographs and serial graphs ⋮ Clique divergent clockwork graphs and partial orders ⋮ Distances and diameters on iterated clique graphs ⋮ On the clique behavior of circulants with three small jumps

This page was built for publication: Locally \(C_6\) graphs are clique divergent