Narahari Narasimha Swamy

Dr. Narahari Narasimha Swamy

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 August 2021 in Nanosystems: Physics, Chemistry, Mathematics
Verified
Journal Article
Closed access
GJGowtham K J
Gowtham K J
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy

27 April 2019 in Arab Journal of Mathematical Sciences
Verified
Journal Article
Open access
PDF file
B. SooryanarayanaB. Sooryanarayana
B. Sooryanarayana
SKShreedhar Kunikullaya
Shreedhar Kunikullaya
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy
In a graph G, a vertex w∈V(G) resolves a pair of vertices u,v∈V(G) if d(u,w)≠d(v,w). A resolving set of G is a set of vertices S such that every pair of distinct vertices in V(G) is resolved by some vertex in S. The minimum cardinality among all the resolving sets of G is called the metric dimension of G, denoted by β(G). The metric dimension of a wheel has been obtained in an earlier paper (Shanmukha et al., 2002). In this paper, the metric dimension of the family of generalized wheels is obtained. Further, few properties of the metric dimension of the corona product of graphs have been discussed and some relations between the metric dimension of a graph and its generalized corona product are established.

25 December 2023 in Communications in Mathematics and Applications
Verified
Journal Article
Open access
PDF file
HSH. C. Shilpa
H. C. Shilpa
GKGayathri Karthick
Gayathri Karthick
HNH. M. Nagesh
H. M. Nagesh
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy
For a graph $G$, the M-polynomial is defined as \(M(G;x,y)= \sum_{\delta \leq \alpha \leq \beta \leq \Delta}m_{\alpha \beta}(G)x^{\alpha}y^{\beta}\), where \(m_{\alpha \beta} (\alpha, \beta \geq 1)\), is the number of edges \(ab\) of \(G\) such that \(\deg_{G}(a)=\alpha\) and \(\deg_{G}(b)=\beta\), and \(\delta\) is the minimum degree and \(\Delta\) is the maximum degree of \(G\). The physiochemical properties of chemical graphs are found by topological indices, in particular, the degree-based topological indices, which can be determined from an algebraic formula called M-polynomial.\ We compute the closest forms of M-polynomial for Mycielskian of paths and cycles. Further, we plot the 3-D graphical representation of M-polynomial.\ Finally, we derive some degree-based topological indices with the help of M-polynomial.

1 January 2025 in Match Communications in Mathematical and in Computer Chemistry
Verified
Journal Article
Open access
STSharathkumar Hunjanalu Thimmarayappa
Sharathkumar Hunjanalu Thimmarayappa
SKShrikanth Chikkenahalli Krishnamurthy
Shrikanth Chikkenahalli Krishnamurthy
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy
HNHadonahally Mudalagiraiah Nagesh
Hadonahally Mudalagiraiah Nagesh
UKUppari Vijaya Chandra Kumar
Uppari Vijaya Chandra Kumar
Introduced by Arizmendi et al. in the year 2018, the energy EG(v) of a vertex v of a graph gives the graph energy distribution over all its vertices and is found to be very useful in understanding the influence of individual vertices on the overall graph energy. In this paper, we determine the vertex energies of some particular classes of trees. Consequently, we obtain the vertex energies of all integral trees on at most 30 vertices.

1 December 2025 in International Journal of Mathematics for Industry
Verified
Journal Article
Open access
CSC. K. Shrikanth
C. K. Shrikanth
HSH. T. Sharathkumar
H. T. Sharathkumar
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy
HNH. M. Nagesh
H. M. Nagesh
UKU. Vijaya Chandra Kumar
U. Vijaya Chandra Kumar
Graph energy is one of the most significant aspects in mathematical chemistry that has generated a lot of interest in researchers over a long period of time. The concept of energy of a vertex, introduced by Arizmendi et al., provides a local spectral perspective to the graph energy, highlighting the significance of individual vertex energies and their contribution to the total energy of the graph, and therefore becomes important to understand the role of each vertex in understanding the spectral properties of the graph. In literature, various authors have worked on studying the properties of vertex energy and computing the same for various classes of graphs using the method explained in the original paper. Particularly, computing the vertex energies of integral graphs is commonly found in recent studies as it involves graphs with only integer eigenvalues, thereby ensuring that exact values of vertex energies and not numerical approximations are obtained in an efficient manner. Recently, Gutman et al. have proposed a novel approach to compute the vertex energy of a graph using eigenvalues and eigenvectors of a graph with a specified number of vertices. In the present study, we adopt this innovative approach, particularly useful with graphs having too many distinct eigenvalues and large number of vertex symmetries, to determine the vertex energies for all 22 connected integral graphs of order eight by finding all the eigenvalues and their corresponding orthonormal eigenvectors using the Gram–Schmidt process.

2 January 2022 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
NSNarahari Narasimha Swamy
Narahari Narasimha Swamy
CGChandan Katigenahalli gangappa
Chandan Katigenahalli gangappa
PPPrasanna Poojary
Prasanna Poojary
B. SooryanarayanaB. Sooryanarayana
B. Sooryanarayana
NMNagesh Hadonahalli Mudalagiraiah
Nagesh Hadonahalli Mudalagiraiah
Topological indices of chemical structures are found to be very useful in understanding many of their intrinsic properties. Wiener index, Zagreb indices, the generalized Randić index, Szeged index and harmonic index are some of the indices commonly used for the QSAR and QSPR of chemical graphs and nanostructures. In this article, we compute some of the important topological indices of the 2D-lattice, nanotube and nanotorus of the TUC4C8(R) [p, q] nanostructure and their subdivision graphs by finding their M-polynomials.