Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: The clique operator on graphs with few P-4's
Author: de Mello, CP
Morgana, A
Liverani, M
Abstract: The clique graph of a graph G is the intersection graph K (G) of the (maximal) cliques of G. The iterated clique graphs V (G) are defined by K-0(G) = 6 and K-i (G) = K (Ki-1 (G)), i > 0 and K is the clique operator. In this article we use the modular decomposition technique to characterize the K-behaviour of some classes of graphs with few P-4's. These characterizations lead to polynomial time algorithms for deciding the K-convergence or K-divergence of any graph in the class. (c) 2005 Elsevier B.V. All rights reserved.
Subject: iterated clique graphs
clique divergence
modular decompositions.
P-4-tidy graphs
Country: Holanda
Editor: Elsevier Science Bv
Citation: Discrete Applied Mathematics. Elsevier Science Bv, v. 154, n. 3, n. 485, n. 492, 2006.
Rights: fechado
Identifier DOI: 10.1016/j.dam.2005.09.002
Date Issue: 2006
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000235858300006.pdf203.59 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.