Graph relations, clique divergence and surface triangulations

Authors:
F. Larrión;V. Neumann-Lara;M. A. Pizaña
Affiliations:
Instituto de Matemáticas, U.N.A.M. Circuito Exterior, C.U. Meéxico 04510 D.F. Mexico;Instituto de Matemáticas, U.N.A.M. Circuito Exterior, C.U. Meéxico 04510 D.F. Mexico;Universidad Autónoma Metropolitana, Depto. de Ingeniería Eléctrica., Av. San Rafael Atlixco 186, Col Vicentina, México 09340 D.F. Mexico
Venue:
Journal of Graph Theory
Year:
2006

Citing 0
Cited 6

A new family of expansive graphs

Discrete Applied Mathematics
The fundamental group of the clique graph

European Journal of Combinatorics
On expansive graphs

European Journal of Combinatorics
The complexity of clique graph recognition

Theoretical Computer Science
Edge contraction and edge removal on iterated clique graphs

Discrete Applied Mathematics
Split clique graph complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work has two aims: first, we introduce a powerful technique for proving clique divergence when the graph satisfies a certain symmetry condition. Second, we prove that each closed surface admits a clique divergent triangulation. By definition, a graph is clique divergent if the orders of its iterated clique graphs tend to infinity, and the clique graph of a graph is the intersection graph of its maximal complete subgraphs. © 2005 Wiley Periodicals, Inc. J Graph Theory