Abstract
Abstract The clique graph kG of a graph G is the intersection graph of the family of all maximal complete subgraphs of G . The iterated clique graphs k n G are defined by k 0 G = G and k n +1 G = kk n G . A graph G is said to be k -divergent if | V ( k n G )| tends to infinity with n . We provide examples of k -divergent graphs such that the diameters of the iterated clique graphs also tend to infinity with n . Furthermore, the sizes of the cliques and even the chromatic numbers remain bounded.
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.
