Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654691 | European Journal of Combinatorics | 2009 | 7 Pages |
Abstract
Given a finite connected bipartite graph B=(X,Y)B=(X,Y) we consider the simplicial complexes of complete subgraphs of the square B2B2 of BB and of its induced subgraphs B2[X]B2[X] and B2[Y]B2[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 GG is isomorphic to that of the clique graph K(G)K(G), the line graph L(G)L(G) and the total graph T(G)T(G).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F. Larrión, M.A. Pizaña, R. Villarroel-Flores,