Minimum clique-clique dominating energy of a graph

Udupa, Sayinath and Bhat, R S and Prathviraj, N (2020) Minimum clique-clique dominating energy of a graph. Advances in Mathematics: Scientific Journal, 9 (6). pp. 3237-3246. ISSN 1857-8365

[img] PDF
9400.pdf - Published Version
Restricted to Registered users only

Download (238kB) | Request a copy
Official URL: https://doi.org/10.37418/amsj.9.6.4

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 c1,c2 ∈ C(G) are said to clique-clique dominate (cc-dominate) each other if there is a vertex incident with c1 and c2. 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 ccdomination 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 Ecc(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 Ecc(G) are established.

Item Type: Article
Subjects: Information Sciences > MCIS Manipal
Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 21 Aug 2020 09:09
Last Modified: 21 Aug 2020 09:09
URI: http://eprints.manipal.edu/id/eprint/155566

Actions (login required)

View Item View Item