The Energy Graph for Minimum Majority Domination
About this article
DOI:
https://doi.org/10.14419/ijet.v7i4.10.21281Keywords:
Majority Domination matrix, Minimum majority domination Energy value.Abstract
In this article we have introduced Minimum majority domination energy graph. A set  is called a majority dominating set if at least half of the vertices either in or adjacent to the vertices . That is , . The minimum cardinality of a majority dominating set is called majority domination number . We defined majority dominating matrix and its energy values for some classes of graphs. Also some boundaries of Energy value of graph G are obtained.
Â
References
[1] C. Adiga, A. Bayad, I. Gutman, A. S. Shrikanth, (2012), The Minimum Covering Energy Of A Graph,K. J. Sci., 34, 39-56.
[2] R. B. Bapat, S. Pati, (2011), Energy Of A Graph Is Never An Odd Integer,Bul. Kerala Math. Asso.,1129-132.
[3] Gutman, (1978), The Energy Of A Graph,Ber. Math-Statist. Sekt. Forschungsz. Graz, 1031-22.
[4] Gutman, X. Li, J. Zhang, (2009), Graph Energy,(Ed-S: M. Dehmer,F. Em-Mert), Streib., Anal.Comp. Net., From Biology To Linguistics, Wiley-Vch, Weinheim, 145-174.
[5] F. Harary, 1969, Graph Theory,Addison Wesley, Massachusetts.
[6] J.Joseline Manora And V.Swaminathan, (2011), Results On Majority Dominating Sets, Scientia Magna,7(3) 53 58.
[7] R. Kanna, B. N. Dharmendra, And G. Sridhara, (2013), Minimum Dominating Energy Of A Graph,Int. J. Pure Appl. Math., 85:4707-718.
[8] R. Kanna, B. N. Dharmendra, And G. Sridhara, (2013), Laplacian Minimum Dominating Energy Of A Graph,Int. J. Pure Appl. Math., 89:4565-581.