Artículos de revistas
The clique operator on graphs with few P-4's
Registro en:
Discrete Applied Mathematics. Elsevier Science Bv, v. 154, n. 3, n. 485, n. 492, 2006.
0166-218X
WOS:000235858300006
10.1016/j.dam.2005.09.002
Autor
de Mello, CP
Morgana, A
Liverani, M
Institución
Resumen
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. 154 3 485 492