TY - JOUR
T1 - Edge contraction and edge removal on iterated clique graphs
AU - Frías-Armenta, M. E.
AU - Larrión, F.
AU - Neumann-Lara, V.
AU - Pizaña, M. A.
PY - 2013/7
Y1 - 2013/7
N2 - The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques. We explore the effect of operations like edge contraction, edge removal and others on the dynamical behavior of a graph under the iteration of the clique operator K. As a consequence of this study, we can now prove the clique divergence of graphs for which no previously known technique would yield the result. In particular, we prove that every clique divergent graph is a spanning subgraph of a clique divergent graph with diameter two.
AB - The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques. We explore the effect of operations like edge contraction, edge removal and others on the dynamical behavior of a graph under the iteration of the clique operator K. As a consequence of this study, we can now prove the clique divergence of graphs for which no previously known technique would yield the result. In particular, we prove that every clique divergent graph is a spanning subgraph of a clique divergent graph with diameter two.
KW - Edge contraction
KW - Edge removal
KW - Iterated clique graphs
KW - Local cutpoints
UR - http://www.scopus.com/inward/record.url?scp=84876412381&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2013.02.003
DO - 10.1016/j.dam.2013.02.003
M3 - Artículo
SN - 0166-218X
VL - 161
SP - 1427
EP - 1439
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 10-11
ER -