Title of article
On expansive graphs
Author/Authors
Larriَn، نويسنده , , F. and Neumann-Lara، نويسنده , , V. and Pizaٌa، نويسنده , , M.A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
372
To page
379
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.
Journal title
European Journal of Combinatorics
Serial Year
2009
Journal title
European Journal of Combinatorics
Record number
1547089
Link To Document