Dismantlings and iterated clique graphs

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)263-265
Number of pages3
JournalDiscrete Mathematics
Volume282
Issue number1-3
DOIs
StatePublished - 6 May 2004

Keywords

  • Clique behaviour
  • Clique graphs
  • Dismantlings
  • Iterated clique graphs

Fingerprint

Dive into the research topics of 'Dismantlings and iterated clique graphs'. Together they form a unique fingerprint.

Cite this