The minimum vertex-block dominating energy of the graph
N. V. Sayinath Udupa, Radhakrishna Bhat, Vinay Madhusudanan · Proceedings of the Jangjeon Mathematical Society · 2019
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