Article Per Year (5 Year)
p-Index From 2019 - 2024
0.408
P-Index
This Author published in this journals
All Journal Journal of the Indonesian Mathematical Society
rajesh kanna
Post Graduate Department of Mathematics, Maharanis Science College for Women, Mysore 570005, Karnataka, India./
Mathematics

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

Found 5 Documents
Search

 1 
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.
New Bounds for Distance Energy of A Graph Sridhara, G.; Kanna, Rajesh; Parashivamurthy, H.L.
Journal of the Indonesian Mathematical Society Volume 26 Number 2 (July 2020)
Publisher : IndoMS

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

Abstract

For any connected graph G, the distance energy, E_D(G) is defined as the sum of the absolute eigenvalues of its distance matrix.  Distance energy was introduced by Indulal et al in the year 2008. It has significant importance in QSPR analysis of molecular descriptor to study  their physico-chemical properties. Our interest in this article is to establish new lower and upper bounds for distance energy.
New Bounds for Distance Energy of A Graph Sridhara, G.; Kanna, Rajesh; Parashivamurthy, H.L.
Journal of the Indonesian Mathematical Society Volume 26 Number 2 (July 2020)
Publisher : IndoMS

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

Abstract

For any connected graph G, the distance energy, E_D(G) is defined as the sum of the absolute eigenvalues of its distance matrix.  Distance energy was introduced by Indulal et al in the year 2008. It has significant importance in QSPR analysis of molecular descriptor to study  their physico-chemical properties. Our interest in this article is to establish new lower and upper bounds for distance energy.
MINIMUM COVERING SEIDEL ENERGY OF A GRAPH Kanna, Rajesh; R, Jagadeesh; Farahani, Mohammad Reza
Journal of the Indonesian Mathematical Society Volume 22 Number 1 (April 2016)
Publisher : IndoMS

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

Abstract

In this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs. Upper and lower bounds for minimum covering Seidel energies of agraphs are also established.DOI : http://dx.doi.org/10.22342/jims.22.1.234.71-82
Co-Authors DHARMENDRA B N Jagadeesh R, Jagadeesh Mohammad Reza Farahani, Mohammad Reza Parashivamurthy, H.L. SRIDHARA G Sridhara, G.