Abstract
The clique graph of a graph G is the intersection graph K( G) of the (maximal) cliques of G. The iterated clique graphs K n ( G) are defined by K 0( G)= G and K i ( G)= K( K i−1 ( G)), i>0 and K is the clique operator. A cograph is a graph with no induced subgraph isomorphic to P 4. In this article we use the modular decomposition technique to characterize the K-behaviour of cographs and to give some partial results for the larger class of serial (i.e. complement-disconnected) graphs. We prove that a cograph is K-convergent if and only if it is clique-Helly. This characterization leads to a polynomial time algorithm for deciding the K-convergence or K-divergence of any cograph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
