Udupa, Sayinath and Bhat, R S
(2018)
*Minimum bb-dominating Energy of Graphs.*
International Journal of Pure and Applied Mathematics, 120 (8).
pp. 29-37.
ISSN 1311-8080

PDF
6114.pdf - Published Version Restricted to Registered users only Download (259kB) | Request a copy |

## Abstract

Let B(G) denotes the set of all blocks of a graph G. Two blocks in G are adjacent if there is a common cutvertex incident on them. Two blocks b1, b2 2 B(G) are said to blockblock dominate (bb-dominate) each other if there is a common vertex incident with b1 and b2. A set L � B(G) is said to be a bb-dominating set (BBD-set) if every block in G is bb-dominated by some block in L. The bb-domination number bb = bb(G) is the order of a minimum bb-dominating set of G. In this paper we introduce new kind of graph energy, the minimum bb-dominating energy of the graph denoting it as Ebb(G). It depends both on underlying graph of G and its particular minimum bb-dominating set ( bb-set) of G. Upper and lower bounds for Ebb(G) are established

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Energy of the graph, the minimum bb-dominating energy of the graph |

Subjects: | Engineering > MIT Manipal > Mathematics |

Depositing User: | MIT Library |

Date Deposited: | 25 Feb 2019 06:35 |

Last Modified: | 25 Feb 2019 06:35 |

URI: | http://eprints.manipal.edu/id/eprint/153329 |

### Actions (login required)

View Item |