UKUppari Vijaya Chandra Kumar

Uppari Vijaya Chandra Kumar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Uppari Vijaya Chandra Kumar has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Generalized Vertex Energy of a Graph

    by Narahari Narasimha Swamy, Sharathkumar Hunjanalu Thimmarayappa, Shrikanth Chikkenahalli Krishnamurthy, Hadonahally Mudalagiraiah Nagesh, Uppari Vijaya Chandra Kumar

    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

    Vertex energy of some integral graphs

    by C. K. Shrikanth, H. T. Sharathkumar, N. Narahari, H. M. Nagesh, 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.


  • Edge irregularity strength of uniform theta graphs, generalized 4-prism graphs, and its applications in communication networks

    by Umme Salma, H. M. Nagesh, U. Vijaya Chandra Kumar

    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

    Independent Domination Degree of Standard Graphs of Adriatic \((a,b)\)-KA Indices

    by Anjaneyulu Mekala, U. Vijaya Chandra Kumar, R. Murali

    The dominating set \(D\) of the graph \(K=(V,E)\) is the independent dominating set (Ids), the independent domination number \(i(K)\) of the graph \(K\) is the minimum cardinality of id. In this article, we introduce the new independent degree domination (idd) of each vertices \(s\in V(K)\), denoted by \(d_{id}(s)\) and compute the Adriatic \((a,b)\)-KA index for book graphs, cycle middle graphs and windmill graphs.

  • Open Access

    Preface

    by M. Vishu Kumar, A. Salma, B. N. Hanumagowda, U. Vijaya Chandra Kumar

    It is a great privilege for us to present the proceedings of the Third International Conference on Recent Trends in Applied and Computational Mathematics (ICRTACM-2022), held at Department of Mathematics, School of Applied Sciences, REVA University, Bangalore, India during 10th and 11th October 2022 as a special issue entitled “Recent Trends in Applied and Computational Mathematics” in the Communications in Mathematics and Applications. We hope that you will find it useful, exciting and inspiring. Mathematics is an ever-evolving field, with applications that extend across multiple disciplines, from engineering and physics to economics and computer science. The synergy between applied and computational mathematics has paved the way for numerous breakthroughs and innovations. This conference served as a platform for researchers from academic and industry to present their original work and exchange ideas, information, techniques, and applications in the field of Applied and Computational Mathematics. The papers included in these proceedings reflect the diversity and depth of mathematical research showcased during the conference. They delve into a wide spectrum of topics, from abstract theories to real-world problem-solving. The research presented here is a testament to the collective efforts of mathematicians who are pushing the boundaries of human understanding. We would like to extend our heartfelt gratitude to all the participants, authors, reviewers, and organizers who contributed to the success of this conference. Your dedication and passion for mathematics have been instrumental in creating a vibrant and stimulating environment for intellectual exchange. We hope that these proceedings serve as a valuable resource for researchers, students, and enthusiasts alike, inspiring further exploration and collaboration in the fascinating world of mathematics. We also record our thanks to RGN Publications and its editorial staff for their sincere cooperation in the publication of this proceedings.

  • Open Access

    Roman Domination in the Shadow Distance Graphs

    by K. Kallesh, U. Vijaya Chandra Kumar, R. Murali

    A function \(\psi: \mathcal{V} \rightarrow \{0,1,2\}\) satisfying the requirement that each vertex \(x\) for which \(\psi(x)=0\) is adjacent to at least one vertex \(y\) for which \(\psi(y)=2\) is known as a Roman dominating function (Rdf) on a graph. A Rdf's weight is represented by the value \(\psi(y)= \sum_{x\in \mathcal{V}} \psi(x)\). The Roman domination number (Rdn) of a graph \(\mathcal{G}\) is the minimal weight of a Rdf on that graph. In this article, we establish Rdn for the shadow distance graph of the path, cycle, and star graphs with predetermined distance sets.

  • Open Access

    Topological Indices Polynomials of Domination David Derived Networks

    by Anjaneyulu Mekala, Vijaya Chandra Kumar U, R. Murali

    ترتبط الخصائص الكيميائية للمركبات الكيميائية وبنيتها الجزيئية ارتباطًا وثيقًا. المؤشرات الطوبولوجية هي قيم عددية مرتبطة بالرسوم البيانية الجزيئية الكيميائية التي تساعد في فهم الخصائص الفيزيائية والكيميائية والتفاعل الكيميائي والنشاط البيولوجي للمركب الكيميائي. يتطرق هذا البحث على بعض الخصائص الطوبولوجية للشبكات المشتقة من dominating David derived وتحصي العديد من K Banhatti متعدد الحدود من النوع الثاني والثالث من DDD.


  • Open Access

    Some K-Banhatti Polynomials of First Dominating David Derived Networks

    by Anjaneyulu Mekala, Vijaya Chandra Kumar U, R. Murali

    Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.