共 50 条
Dismantlings and iterated clique graphs
被引:17
作者:
Frías-Armenta, ME
Neumann-Lara, V
Pizaña, MA
机构:
[1] Univ Sonora, Dept Matemat, Div Ciencias Exactas & Nat, Hermosillo, Sonora, Mexico
[2] Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
[3] Univ Autonoma Metropolitana Iztapalapa, Dept Ingn Elect, Mexico City 09340, DF, Mexico
关键词:
clique graphs;
iterated clique graphs;
dismantlings;
clique behaviour;
D O I:
10.1016/j.disc.2003.12.011
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Given a graph G and two vertices x, y is an element of 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. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:263 / 265
页数:3
相关论文