On expansive graphs

Authors:
F. Larrión;V. Neumann-Lara;M. A. Pizaña
Affiliations:
Instituto de Matemáticas, Universidad Nacional Autónoma de México, México, D.F. C.P. 04510, Mexico;Instituto de Matemáticas, Universidad Nacional Autónoma de México, México, D.F. C.P. 04510, Mexico;Depto. de Ingeniería Eléctrica, Universidad Autónoma Metropolitana, Av. San Rafael Atlixco 186, Col Vicentina, México 09340 D.F., Mexico
Venue:
European Journal of Combinatorics
Year:
2009

Citing 9
Cited 2

Clique graphs and Helly graphs

Journal of Combinatorial Theory Series B
A class of clique-closed graphs

Discrete Mathematics - Special issue on graph theory and applications
On the radius and diameter of the clique graph

Discrete Mathematics
Clique divergent graphs with unbounded sequence of diameters

Discrete Mathematics
Locally C6 graphs are clique divergent

Discrete Mathematics
The icosahedron is clique divergent

Discrete Mathematics
The clique operator on graphs with few P4's

Discrete Applied Mathematics
Iterated clique graphs with increasing diameters

Journal of Graph Theory
Graph relations, clique divergence and surface triangulations

Journal of Graph Theory

The clique operator on circular-arc graphs

Discrete Applied Mathematics
Edge contraction and edge removal on iterated clique graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The clique graph K(G) of a graph G, is the intersection graph of its (maximal) cliques, and G is K-divergent if the orders of its iterated clique graphs K(G),K^2(G),K^3(G),... tend to infinity. A coaffine graph has a symmetry that maps each vertex outside of its closed neighbourhood. For these graphs we study the notion of expansivity, which implies K-divergence.