Graph relations,clique divergence and surface triangulations |
| |
Authors: | F Larrin V Neumann‐Lara MA Pizaa |
| |
Institution: | F. Larrión,V. Neumann‐Lara,M.A. Pizaña |
| |
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 |
| |
Keywords: | iterated clique graphs surface triangulations coaffine graphs |
|
|