International Journal of Mathematics Trends and Technology
Volume 40 | Number 3 | Year 2016 | Article Id. IJMTT-V40P529 | DOI : https://doi.org/10.14445/22315373/IJMTT-V40P529
Let G = (V;E) be a nite con- nected graph. A set D V is a dom- inating set of G if every vertex in V-D is adjacent to some vertex in D. A dom- inating set D of G is called a minimal dominating set if no proper subset of D is a dominating set. In this paper soS- hearEnergy of Jahangir graph J2;m is calculated for all possible minimal domi- nating set. Energy cure for those graphs are ploted. Hardihood + and - of the Jahangir graph J2;m is also calculated.
[1] Acharya B.D., Rao S.B., Sumathi P., Swaminathan V., Energy of a set of vertices in a graph, AKCE J.Graphs. Combin., 4 No. 2(2007), 145-152.
[2] Jeyakokila S.P. and Sumathi P., soEnergy of some standard graphs, Procedia Computer Science, Volume 47, 2015, pages 360-367.
[3] Mojdeh D.A., Ghameshlon A.N., Domination in Jahangir Graph J2;m , Int. J. Contemp. Math. Sciences, Vol.2, 2007, no.24, 1193-1199.
[4] Sumathi P., Jeyakokila S.P., Energy of set of vertices-A computational method, IJMSEA Vol. 7 No. III (May, 2013), pp. 137-148.
[5] Terasa W. Haynes,Stephen T.Hedetneimi,Peter J.Slater, Funda- mentals of Domination in Graphs, Marcel Dekker Inc.(1998).
[6] Terasa W. Haynes,Stephen T.Hedetneimi,Peter J.Slater, Domi- nation in Graphs:Advanced Topics, Marcel Dekker Inc.(1998)
[7] West D.B., Introduction to Graph Theory, Prenctice-Hall of India, Pvt. Ltd., 1999.
[8] Xueliang Li,Yongtang Shi, Ivan Gut- man, Graph Energy, Springer ,2012.
S.P.Jeyakokila, P.Sumathi, "A Note on soShearEnergy of Jahangir graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 40, no. 3, pp. 237-246, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V40P529
PDF 
Abstract 
Keywords 
References 
Citation