Narahari Narasimha Swamy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Narahari Narasimha Swamy has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Hadonahally Mudalagiraiah Nagesh
Department of Science and Humanities, PES University, Bangalore, India
6 shared publications - Shrikanth Chikkenahalli Krishnamurthy
Tumkur University
4 shared publications - Badekara Sooryanarayana
Nitte University image/svg+xml
3 shared publications - Sharathkumar Hunjanalu Thimmarayappa
Tumkur University
3 shared publications - Uppari Vijaya Chandra Kumar
Department of Mathematics, School of Applied Sciences, REVA University, Bengaluru, India
2 shared publications - Chandan Katigenahalli Gangappa
Department of Studies and Research in Mathematics, Tumkur University, Tumkur, India
1 shared publication
Latest Publications
- 10 July 2026
- Published by Springer Nature in Acta Universitatis Sapientiae, Informatica
- Vol. 18 (1) , 20
Edge Irregularity Strength of Graphs: Theoretical Results and Applications to Communication Networks
- 10 July 2026
- Published by Springer Nature in Acta Universitatis Sapientiae, Informatica
- Vol. 18 (1) , 20
Edge Irregularity Strength of Graphs: Theoretical Results and Applications to Communication Networks
- Open Access
- 27 May 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 97 (2027) (2) , 523
On the Generalized Vertex Energy of a Graph
The notions of vertex energy and centrality measures are significant graph invariants that describe the contribution of individual vertices to the total energy of graph. Unlike global energy measures, they provide vertex-level information and allow the identification of structurally significant vertices. In this article, we extend the notion of energy of a vertex (EG(v)) by defining the general vertex degreebased (VDB)vertex energy. Further, we study some particular types of this invariant, namely the first Zagreb vertex energy (M1EG(v)), second Zagreb vertex energy (M2EG(v)), forgotten vertex energy (FEG(v)), Sombor vertex energy (SOEG(v)) and atom-bond connectivity vertex energy (ABCEG(v)), derived from the corresponding VDB topological indices and their associated VDB index-weighted adjacency matrices. Furthermore, using the method proposed by Arizmendi et al., we compute these invariants for certain standard graphs. Subsequently, we perform a vertex-level regression analysis between the eigenvector centrality measure (Xi) and these particular VDB vertex energy invariants, with reference to each of the 18 octane isomers, through which we observe a strong correlation between these parameters, thereby establishing their significance.
- 27 May 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 97 (2027) (2) , 523
Open AccessOn the Generalized Vertex Energy of a Graph
The notions of vertex energy and centrality measures are significant graph invariants that describe the contribution of individual vertices to the total energy of graph. Unlike global energy measures, they provide vertex-level information and allow the identification of structurally significant vertices. In this article, we extend the notion of energy of a vertex (EG(v)) by defining the general vertex degreebased (VDB)vertex energy. Further, we study some particular types of this invariant, namely the first Zagreb vertex energy (M1EG(v)), second Zagreb vertex energy (M2EG(v)), forgotten vertex energy (FEG(v)), Sombor vertex energy (SOEG(v)) and atom-bond connectivity vertex energy (ABCEG(v)), derived from the corresponding VDB topological indices and their associated VDB index-weighted adjacency matrices. Furthermore, using the method proposed by Arizmendi et al., we compute these invariants for certain standard graphs. Subsequently, we perform a vertex-level regression analysis between the eigenvector centrality measure (Xi) and these particular VDB vertex energy invariants, with reference to each of the 18 octane isomers, through which we observe a strong correlation between these parameters, thereby establishing their significance.
- Open Access
- 1 December 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Mathematics for Industry
- Vol. 17 (01)
Vertex energy of some integral graphs
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.
- 1 December 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Mathematics for Industry
- Vol. 17 (01)
Open AccessVertex energy of some integral graphs
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.
- Open Access
- 14 November 2025
- Published by AMG Transcend Association in Biointerface Research in Applied Chemistry
- Vol. 15 (6)
Reduced Reverse Topological Indices and Entropy Measures of Tetracyanobenzene MOFs
Modern material research relies heavily on metal-organic frameworks (MOFs), which are known for their highly porous and structurally tunable architectures, as well as their significance in drug delivery, gas storage, and catalysis. Topological indices (TIs) are numerical parameters that are graph invariant and describe the topology of a graph. In quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR) analysis, these topological indices and entropy measures (𝔼𝑠), obtained using these topological indices, help in predicting the physicochemical properties of compounds. In this study, we derive closed formulae for several reduced reverse (RR) degree-based topological indices and their corresponding entropy measures of the Tetracyanobenzene (TCNB) metal-organic framework TCNB(p,q). In order to prove the essential significance and validate the obtained results, we additionally perform a graphical and comparative analysis between these indices for various values of p and q.
- 14 November 2025
- Published by AMG Transcend Association in Biointerface Research in Applied Chemistry
- Vol. 15 (6)
Open AccessReduced Reverse Topological Indices and Entropy Measures of Tetracyanobenzene MOFs
Modern material research relies heavily on metal-organic frameworks (MOFs), which are known for their highly porous and structurally tunable architectures, as well as their significance in drug delivery, gas storage, and catalysis. Topological indices (TIs) are numerical parameters that are graph invariant and describe the topology of a graph. In quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR) analysis, these topological indices and entropy measures (𝔼𝑠), obtained using these topological indices, help in predicting the physicochemical properties of compounds. In this study, we derive closed formulae for several reduced reverse (RR) degree-based topological indices and their corresponding entropy measures of the Tetracyanobenzene (TCNB) metal-organic framework TCNB(p,q). In order to prove the essential significance and validate the obtained results, we additionally perform a graphical and comparative analysis between these indices for various values of p and q.
- Open Access
- 1 January 2025
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 95 (2) , 467-485
On the Vertex Energy of Small Integral Trees
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 January 2025
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 95 (2) , 467-485
Open AccessOn the Vertex Energy of Small Integral Trees
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.
- Open Access
- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1375-1383
M-Polynomials and Degree-Based Topological Indices of Mycielskian of Paths and Cycles
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.- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1375-1383
Open AccessM-Polynomials and Degree-Based Topological Indices of Mycielskian of Paths and Cycles
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. - 2 January 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (1) , 265-282
Topological indices of the subdivision graphs of the nanostructure TUC4C8(R) using M-polynomials
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.
- 2 January 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (1) , 265-282
Topological indices of the subdivision graphs of the nanostructure TUC4C8(R) using M-polynomials
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.
- 28 August 2021
- Published by ITMO University in Nanosystems: Physics, Chemistry, Mathematics
- Vol. 12 (4) , 411-417
On Sombor energy of graphs
- 28 August 2021
- Published by ITMO University in Nanosystems: Physics, Chemistry, Mathematics
- Vol. 12 (4) , 411-417
On Sombor energy of graphs
- Open Access
- 27 April 2019
- Published by Emerald Publishing in Arab Journal of Mathematical Sciences
- Vol. 25 (2) , 131-144
Metric dimension of generalized wheels
In a graph , a vertex resolves a pair of vertices if . A resolving set of is a set of vertices such that every pair of distinct vertices in is resolved by some vertex in . The minimum cardinality among all the resolving sets of is called the metric dimension of , denoted by . 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.- 27 April 2019
- Published by Emerald Publishing in Arab Journal of Mathematical Sciences
- Vol. 25 (2) , 131-144
Open AccessMetric dimension of generalized wheels
In a graph , a vertex resolves a pair of vertices if . A resolving set of is a set of vertices such that every pair of distinct vertices in is resolved by some vertex in . The minimum cardinality among all the resolving sets of is called the metric dimension of , denoted by . 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. - Open Access
- 1 November 2014
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of Mathematical and Fundamental Sciences
- Vol. 43 (3) , 245-262
Open Neighborhood Coloring of Prisms
- 1 November 2014
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of Mathematical and Fundamental Sciences
- Vol. 43 (3) , 245-262
Open AccessOpen Neighborhood Coloring of Prisms