The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence

DOI10.1016/J.DISC.2024.113912MaRDI QIDQ6204329zbMATH OpenOpenAlexWikidataFDO

Authors Martin Winter

Publication date 27 March 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2307.11238

zbMATH Keywords

clique graphslattice graphshexagonal latticeclique divergenceclique convergenceclique dynamics

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• Locally \(C_6\) graphs are clique divergent
• On the clique behavior of graphs of low degree
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
• Clique divergent graphs with unbounded sequence of diameters
• A family of clique divergent graphs with linear growth

Cites work

• Clique divergent graphs with unbounded sequence of diameters
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
• Locally \(C_6\) graphs are clique divergent

This page was built for publication: The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204329)