Hadonahally Mudalagiraiah Nagesh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hadonahally Mudalagiraiah Nagesh has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Narahari Narasimha Swamy
Department of Mathematics, University College of Science, Tumkuru University, Tumakuru, India
6 shared publications - Umme Salma
Department of Science and Humanities, PES University, Bangalore, India
4 shared publications - Muhammad Kamran Siddiqui
Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Pakistan
3 shared publications - Sharathkumar Hunjanalu Thimmarayappa
Tumkur University
3 shared publications - Shrikanth Chikkenahalli Krishnamurthy
Tumkur University
3 shared publications - U. Vijaya Chandra Kumar
Department of Mathematics, School of Applied Sciences, REVA University, Bangalore, India
3 shared publications
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
Edge Irregularity Strength: A Complementary Descriptor to Topological Indices in QSPR and QSAR Studies
In chemical graph theory, topological indices are widely used as numerical descriptors for establishing quantitative structure-property relationships (QSPR) and quantitative structure-activity relationships (QSAR). These indices successfully correlate molecular structure with various physicochemical and biological properties. In addition to these methods, the concept of edge irregularity strength, a graph labeling measure, offers another perspective for representing structural characteristics. In this context, the edge irregularity strength concept provides a systematic way of assigning numerical labels to atoms based on specific rules. In this work, we explore the chemical applicability of the edge irregularity strength and demonstrate that it can also serve as a predictive tool for physicochemical properties, similar to topological indices. The findings show that the edge irregularity strength captures molecular features and complements existing approaches to structure-property analysis in chemical graph theory.
Open AccessEdge Irregularity Strength: A Complementary Descriptor to Topological Indices in QSPR and QSAR Studies
In chemical graph theory, topological indices are widely used as numerical descriptors for establishing quantitative structure-property relationships (QSPR) and quantitative structure-activity relationships (QSAR). These indices successfully correlate molecular structure with various physicochemical and biological properties. In addition to these methods, the concept of edge irregularity strength, a graph labeling measure, offers another perspective for representing structural characteristics. In this context, the edge irregularity strength concept provides a systematic way of assigning numerical labels to atoms based on specific rules. In this work, we explore the chemical applicability of the edge irregularity strength and demonstrate that it can also serve as a predictive tool for physicochemical properties, similar to topological indices. The findings show that the edge irregularity strength captures molecular features and complements existing approaches to structure-property analysis in chemical graph theory.
- 23 October 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (09)
Edge irregularity strength of uniform theta graphs, generalized 4-prism graphs, and its applications in communication networks
For a simple graph [ ], a vertex labeling [ ] is called a [ ]-labeling. The weight of an edge [ ] in [ ], denoted by [ ], is defined as the sum of the labels of its end vertices [ ] and [ ], i.e., [ ]. A [ ]-labeling is considered an edge-irregular [ ]-labeling if the weights of any two distinct edges are different, that is, [ ] for all pairs of distinct edges [ ] and [ ]. The smallest integer [ ] for which such an edge irregular [ ]-labeling exists is the edge irregularity strength of [ ], denoted by es[ ]. In this paper, we find the exact value for the edge irregular [ ]-labeling for uniform theta graphs [ ] for [ ] and [ ] [ ]; [ ] and [ ] [ ]; [ ] [ ], and for two classes of generalized 4-prism graphs [ ] and [ ]. Additionally, this paper discusses an application of edge irregularity strength of graphs for the optimal path selection in communication networks.
- 23 October 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (09)
Edge irregularity strength of uniform theta graphs, generalized 4-prism graphs, and its applications in communication networks
For a simple graph [ ], a vertex labeling [ ] is called a [ ]-labeling. The weight of an edge [ ] in [ ], denoted by [ ], is defined as the sum of the labels of its end vertices [ ] and [ ], i.e., [ ]. A [ ]-labeling is considered an edge-irregular [ ]-labeling if the weights of any two distinct edges are different, that is, [ ] for all pairs of distinct edges [ ] and [ ]. The smallest integer [ ] for which such an edge irregular [ ]-labeling exists is the edge irregularity strength of [ ], denoted by es[ ]. In this paper, we find the exact value for the edge irregular [ ]-labeling for uniform theta graphs [ ] for [ ] and [ ] [ ]; [ ] and [ ] [ ]; [ ] [ ], and for two classes of generalized 4-prism graphs [ ] and [ ]. Additionally, this paper discusses an application of edge irregularity strength of graphs for the optimal path selection in communication networks.
- Open Access
- 4 October 2025
- Published by Elsevier in Results in Engineering
- Vol. 28
Topological indices, entropy measures, and graph energy prediction of porphyrazine and tetrakis porphyrazine
- 4 October 2025
- Published by Elsevier in Results in Engineering
- Vol. 28
Open AccessTopological indices, entropy measures, and graph energy prediction of porphyrazine and tetrakis porphyrazine
- 18 March 2025
- Published by Wiley in International Journal of Quantum Chemistry
- Vol. 125 (7)
Degree‐Based Hybrid Topological Indices and Entropies of Wavy Zigzag Nanoribbons
Graphene nanoribbons (GNRs) have recently accumulated attention as alternative 2D semiconductors due to their remarkable electronic properties. The topological and entropy properties of graphene nanoribbons are very important to fully understand their electronic properties. Graphene nanoribbons with zigzag‐shaped edges are narrow strips of graphene characterized by edges that form a zigzag pattern. In this study, we have obtained the analytical expressions for degree‐based topological indices to uncover the structural properties of graphene nanoribbons composed of nanographene units with zigzag‐shaped edges. Furthermore, we demonstrate the usefulness of different variations of hybrid arithmetic, geometric, harmonic, and Zagreb degree‐based topological and entropy indices for these wavy zigzag nanoribbons.
- 18 March 2025
- Published by Wiley in International Journal of Quantum Chemistry
- Vol. 125 (7)
Degree‐Based Hybrid Topological Indices and Entropies of Wavy Zigzag Nanoribbons
Graphene nanoribbons (GNRs) have recently accumulated attention as alternative 2D semiconductors due to their remarkable electronic properties. The topological and entropy properties of graphene nanoribbons are very important to fully understand their electronic properties. Graphene nanoribbons with zigzag‐shaped edges are narrow strips of graphene characterized by edges that form a zigzag pattern. In this study, we have obtained the analytical expressions for degree‐based topological indices to uncover the structural properties of graphene nanoribbons composed of nanographene units with zigzag‐shaped edges. Furthermore, we demonstrate the usefulness of different variations of hybrid arithmetic, geometric, harmonic, and Zagreb degree‐based topological and entropy indices for these wavy zigzag nanoribbons.
- Open Access
- 24 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Mathematics for Industry
- Vol. 17 (01)
Degree-based topological indices and QSPR analysis of Cytomegalovirus drugs
This study examines several drugs employed in treating Cytomegalovirus (CMV) infections, including Cidofovir, Foscarnet, Ganciclovir, Maribavir, and Valganciclovir. The investigation involves the calculation of degree-based topological indices for these drugs. A quantitative structure–property relationship model is established using linear regression analysis, connecting the drug’s topological indices to eleven physicochemical properties to assess their efficacy. The findings indicate that the third Zagreb index is the most reliable predictor for boiling point, enthalpy of vaporization, and flashpoint. In contrast, the first Zagreb index is the optimal predictor for molar refractivity, polarizability, and surface tension. The forgotten index proves effective in predicting molar volume, and the Randić index is identified as a useful predictor for density.
- 24 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Mathematics for Industry
- Vol. 17 (01)
Open AccessDegree-based topological indices and QSPR analysis of Cytomegalovirus drugs
This study examines several drugs employed in treating Cytomegalovirus (CMV) infections, including Cidofovir, Foscarnet, Ganciclovir, Maribavir, and Valganciclovir. The investigation involves the calculation of degree-based topological indices for these drugs. A quantitative structure–property relationship model is established using linear regression analysis, connecting the drug’s topological indices to eleven physicochemical properties to assess their efficacy. The findings indicate that the third Zagreb index is the most reliable predictor for boiling point, enthalpy of vaporization, and flashpoint. In contrast, the first Zagreb index is the optimal predictor for molar refractivity, polarizability, and surface tension. The forgotten index proves effective in predicting molar volume, and the Randić index is identified as a useful predictor for density.
- Open Access
- 5 February 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (3) , 035203
Statistical analysis of Revan topological indices for drug compounds used in treatment of tuberculosis
One of the most infectious diseases, tuberculosis (TB) has a higher death rate than HIV/AIDS, and as a result of the COVID-19 pandemic, there is concern that the number of TB cases may increase. With the aid of QSPR models, the pharmaceutical industry is continuously searching for methods to enhance medication design procedures to stop the spread of infections and treat recently discovered syndromes or genetically based dysfunctions. QSPR models are mathematical tools that utilize structural properties to establish relationships between a molecular structure and its physicochemical attributes. One way to generate attributes from the molecular graph without the need for experimental measurements is to use topological indices. The goal of this work is to create a QSPR model for tuberculosis drugs and their many physicochemical characteristics using degree-based topological indices.
- 5 February 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (3) , 035203
Open AccessStatistical analysis of Revan topological indices for drug compounds used in treatment of tuberculosis
One of the most infectious diseases, tuberculosis (TB) has a higher death rate than HIV/AIDS, and as a result of the COVID-19 pandemic, there is concern that the number of TB cases may increase. With the aid of QSPR models, the pharmaceutical industry is continuously searching for methods to enhance medication design procedures to stop the spread of infections and treat recently discovered syndromes or genetically based dysfunctions. QSPR models are mathematical tools that utilize structural properties to establish relationships between a molecular structure and its physicochemical attributes. One way to generate attributes from the molecular graph without the need for experimental measurements is to use topological indices. The goal of this work is to create a QSPR model for tuberculosis drugs and their many physicochemical characteristics using degree-based topological indices.
- 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.