Characterising clique convergence for locally cyclic graphs of minimum degree δ ≥ 6
Year: 2024
Type: article
Abstract: The clique graph kG of a graph G has as its vertices the cliques (maximal complete subgraphs) of G , two of which are adjacent in kG if they have non-empty intersection in G . We say that G is clique convergent if k n G ≅ k m G for some n ≠ m , and that G is clique divergent otherwise. We completely characterise the clique convergent graphs in the class of (not necessarily finite) locally cyclic graphs of minimum degree δ ≥ 6 , showing that for such graphs clique divergence is a global phenomenon, dependent on the existence of large substructures. More precisely, we establish that such a graph is clique divergent if and only if its universal triangular cover contains arbitrarily large members from the family of so-called “triangular-shaped graphs”.
Source: Discrete Mathematics
Authors: Anna M. Limbach, Martin Winter
Institutions: RWTH Aachen University, University of Warwick
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: clique graphs, infinite graphs
Open Access status: hybrid
Estimated APC paid: $3,120
OpenAlex ID: W4399831801
