Iterated Clique Graphs and Contractibility
Por:
Larrión F., Pizaña M.A., Villarroel-Flores R.
Publicada:
1 ene 2008
Resumen:
To any graph G we can associate a simplicial complex ? (G) whose simplices are the complete subgraphs of G, and thus we say that G is contractible whenever ? (G) is so. We study the relationship between contractibility and K-nullity of G, where G is called K-null if some iterated clique graph of G is trivial. We show that there are contractible graphs which are not K-null, and that any graph whose clique graph is a cone is contractible. © 2008 Elsevier B.V. All rights reserved.
Filiaciones:
Larrión F.:
Instituto de Matemáticas, Universidad Nacional Autónoma, México. 04510 México D.F., Mexico
Pizaña M.A.:
Universidad Autónoma Metropolitana, Av. San Rafael Atlixco 186. Col. Vicentina. México 09340 D.F., Depto. de Ingenieria Electrica, Av. Col. Vicentina. 09340 D.F., Mexico
Villarroel-Flores R.:
Centro de Investigación en Matemáticas, Universidad Autónoma del Estado de Hidalgo. Carr. Pachuca-Tulancingo km. 4.5, Pachuca, Hgo. 42184, Mexico
|