The Minimum Maximal Domination Energy of a Graph
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Minimum maximal dominating set, minimum maximal domination matrix, minimum maximal eigenvalues, minimum maximal energy of a graphAbstract
Small A dominating set $D$ of a graph $G$ is maximal if $V-D$ is not a dominating set of $G$. The maximal domination number $\gamma_m(G)$ of G is the minimum cardinality of a maximal dominating set in $G$. In this paper, we are introduced minimum maximal domination energy $E_{D}(G)$ of a graph $G$. We are computed minimum maximal domination energies of some standard graphs and a number of well-known families of graphs. Upper and lower bounds for $E_{D}(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.