On clique convergence of graphs

Abstract: Let

G

be a graph and

m a t h c a l 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

m a t h c a l K_{G}

and two elements

Q_{i}, Q_{j} i n m a t h c a l K_{G}

form an edge if and only if

Q_{i} c a p Q_{j} e q e m p t y s e t

. 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 determine the number of cliques in

K (G)

when

G = G_{1} + G_{2}

, prove a necessary and sufficient condition for a clique graph

K (G)

to be complete when

G = G_{1} + G_{2}

, give a characterization for clique convergence of the join of graphs and if

G_{1}

,

G_{2}

are Clique-Helly graphs different from

K_{1}

and

G = G_{1} B o x G_{2}

, then

K^{2} (G) = G

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: On clique convergence of graphs