SRIDHARA G
Post Graduate Department of Mathematics, Maharanis Science College for Women, Mysore 570005, Karnataka, India.

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

MINIMUM DOMINATING DISTANCE ENERGY OF A GRAPH kanna, rajesh; B N, DHARMENDRA; G, SRIDHARA
Journal of the Indonesian Mathematical Society Volume 20 Number 1 (April 2014)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.20.1.133.19-29

Abstract

Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we introduced the concept of minimum dominating distance energyEDd(G) of a graph G and computed minimum dominating distance energies of a Stargraph,Complete graph,Crown graph and Cocktail graphs. Upper and lower boundsfor EDd(G) are also established.DOI : http://dx.doi.org/10.22342/jims.20.1.133.19-29
Bounds on Energy and Laplacian Energy of Graphs G, Sridhara; Kanna, Rajesh
Journal of the Indonesian Mathematical Society Volume 23 Number 2 (October 2017)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.23.2.316.21-31

Abstract

Let G be simple graph with n vertices and m edges. The energy E(G) of G, denotedby E(G), is dened to be the sum of the absolute values of the eigenvalues of G. Inthis paper, we present two new upper bounds for energy of a graph, one in terms ofm,n and another in terms of largest absolute eigenvalue and the smallest absoluteeigenvalue. The paper also contains upper bounds for Laplacian energy of graph.