Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||The Clique Operator On Graphs With Few P4's|
|Author:||De Mello C.P.|
|Abstract:||The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. The iterated clique graphs Kn(G) are defined by K0(G)=G and Ki(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 P4's . These characterizations lead to polynomial time algorithms for deciding the K-convergence or K-divergence of any graph in the class. © 2005 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.