TY - JOUR
T1 - Dismantlings and iterated clique graphs
AU - Frías-Armenta, M. E.
AU - Neumann-Lara, V.
AU - Pizaña, M. A.
PY - 2004/5/6
Y1 - 2004/5/6
N2 - Given a graph G and two vertices x, y ∈ V(G), we say that x is dominated by y if the closed neighbourhood of x is contained in that of y. Here we prove that if x is a dominated vertex, then G and G-{x} have the same dynamical behaviour under the iteration of the clique operator.
AB - Given a graph G and two vertices x, y ∈ V(G), we say that x is dominated by y if the closed neighbourhood of x is contained in that of y. Here we prove that if x is a dominated vertex, then G and G-{x} have the same dynamical behaviour under the iteration of the clique operator.
KW - Clique behaviour
KW - Clique graphs
KW - Dismantlings
KW - Iterated clique graphs
UR - http://www.scopus.com/inward/record.url?scp=2342536991&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2003.12.011
DO - 10.1016/j.disc.2003.12.011
M3 - Artículo
SN - 0012-365X
VL - 282
SP - 263
EP - 265
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -