期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2016
卷号：13
期号：3
页码：261-266
DOI：10.1016/j.akcej.2016.07.002
语种：English
出版社：Elsevier
摘要：Abstract Let G be a graph and K G be the set of all cliques of G , then the clique graph of G denoted by K ( G ) is the graph with vertex set K G and two elements Q i , Q j ∈ K G form an edge if and only if Q i ∩ Q j ≠ 0̸ . Iterated clique graphs are defined by K 0 ( G ) = G , and K n ( G ) = K ( K n − 1 ( G ) ) for n > 0 . In this paper we prove a necessary and sufficient condition for a clique graph K ( G ) to be complete when G = G 1 + G 2 , give a partial characterization for clique divergence of the join of graphs and prove that if G 1 , G 2 are Clique-Helly graphs different from K 1 and G = G 1 □ G 2 , then K 2 ( G ) = G .
