Dismantlings and iterated clique graphs

M. E. Frías-Armenta; V. Neumann-Lara; M. A. Pizaña

doi:10.1016/j.disc.2003.12.011

Dismantlings and iterated clique graphs

M. E. Frías-Armenta^*
, V. Neumann-Lara
, M. A. Pizaña

^*Corresponding author for this work

Departamento de Matemáticas

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	263-265
Number of pages	3
Journal	Discrete Mathematics
Volume	282
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2003.12.011
State	Published - 6 May 2004

Keywords

Clique behaviour
Clique graphs
Dismantlings
Iterated clique graphs

Access to Document

10.1016/j.disc.2003.12.011

Cite this

@article{2d49611ba68248c28b9c1094c8f129d3,

title = "Dismantlings and iterated clique graphs",

abstract = "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.",

keywords = "Clique behaviour, Clique graphs, Dismantlings, Iterated clique graphs",

author = "Fr{\'i}as-Armenta, \{M. E.\} and V. Neumann-Lara and Piza{\~n}a, \{M. A.\}",

year = "2004",

month = may,

day = "6",

doi = "10.1016/j.disc.2003.12.011",

language = "Ingl{\'e}s",

volume = "282",

pages = "263--265",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier BV",

number = "1-3",

}

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 - https://www.scopus.com/pages/publications/2342536991

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 -

Dismantlings and iterated clique graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this