The Minimum Boundary Dominating Energy of a Graph
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Boundary dominating set, Minimum Boundary Domination Matrix, Minimum Boundary Dominating Eigenvalues, Minimum Boundary Dominating Energy of a GraphAbstract
For a graph G, a subset $ B $ of $ V(G) $ is called a boundary dominating set if every vertex of $ V(G)- S $ is vertex boundary dominated by some vertex of $ S $. The boundary domination number $\gamma_{b}(G)$ of G is the minimum cardinality of minimum boundary dominating set in G. In this paper we introduce the minimum boundary dominating energy $E_{B}(G)$ of a graph G and computed minimum boundary dominating energies of some standard graphs. Upper and lower bounds for $E_{B}(G)$ are established.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.