The minimum vertex-block dominating energy of the graph

Udupa, Sayinath and Bhat, R S and Vinay, Madhusudanan (2019) The minimum vertex-block dominating energy of the graph. Proceedings of the Jangieon Mathematical Society, 22 (4). pp. 593-608. ISSN 1598-7264

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

Download (852kB) | Request a copy
Official URL:


Let B(G) denote the set of all blocks of a graph G. A vertex v ∈V and a block b∈B(G) are said to block dominate (b-dominate) each other if v is in the block b. A set D ⊆V is said to be a vertex block dominating set (VBD- set) if every block in G is b-dominated by some vertex in D. The vertex block domination number

Item Type: Article
Uncontrolled Keywords: Energy of the graph, the minimum vertex block dominating energy of the graph, Corona product of the graph
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 30 Nov 2020 10:23
Last Modified: 30 Nov 2020 10:23

Actions (login required)

View Item View Item