### Abstract

Let C(G) denotes the set of all cliques of a graph G. Two cliques in G are adjacent if there is a vertex incident on them. Two cliques c_{1}, c_{2} ∈ C(G) are said to clique-clique dominate (cc-dominate) each other if there is a vertex incident with c_{1} and c_{2} . A set L ⊆ C(G) is said to be a cc-dominating set (CCD-set) if every clique in G is cc-dominated by some clique in L. The cc-domination number γ_{cc} = γ_{cc}(G) is the order of a minimum cc-dominating set of G. In this paper we introduce minimum cc-dominating energy of the graph denoting it as E_{cc} (G). It depends both on underlying graph of G and its particular minimum cc-dominating set (γ_{cc}-set) of G. Upper and lower bounds for E_{cc} (G) are established.

Original language | English |
---|---|

Pages (from-to) | 3237-3246 |

Number of pages | 10 |

Journal | Advances in Mathematics: Scientific Journal |

Volume | 9 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2020 |

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Minimum clique-clique dominating energy of a graph'. Together they form a unique fingerprint.

## Cite this

*Advances in Mathematics: Scientific Journal*,

*9*(6), 3237-3246. https://doi.org/10.37418/amsj.9.6.4