The fundamental group of the clique graph

被引:6
|
作者
Larrion, F. [1 ]
Pizana, M. A. [2 ]
Villarroel-Flores, R. [3 ]
机构
[1] Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
[2] Univ Autonoma Metropolitana, Dept Ingn Elect, Mexico City 09340, DF, Mexico
[3] Univ Autonoma Estado Hidalgo, Ctr Invest Matemat, Pachuca 42184, Hgo, Mexico
关键词
TRIANGULATIONS;
D O I
10.1016/j.ejc.2007.12.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a finite connected bipartite graph B = (X, Y) we consider the simplicial complexes of complete subgraphs of the square B-2 of B and of its induced subgraphs B-2[X] and B-2[Y]. We prove that these three complexes have isomorphic fundamental groups. Among other applications, we conclude that the fundamental group of the complex of complete subgraphs of a graph G is isomorphic to that of the clique graph K(G), the line graph L(G) and the total graph T(G). (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:288 / 294
页数:7
相关论文
共 50 条