Badekara Sooryanarayana
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Badekara Sooryanarayana has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Chandrakala Sogenahalli Boraiah
Nitte University image/svg+xml
7 shared publications G. R. Roshini
Department of Mathematics, Nagarjuna College of Engineering and Technology, Bengaluru, India
5 shared publicationsChandrakala Sogenahalli Boraiah
Department of Mathematics, Nitte Meenakshi Institute of Technology, Bengaluru-560 064, India
4 shared publicationsChandru Hegde
4 shared publications- Vishu Kumar Mallappa
REVA University image/svg+xml
4 shared publications M. Jayalakshmi
3 shared publications
Latest Publications
- 31 July 2026
- Published by Taru Publications in Journal of Information and Optimization Sciences
- Vol. 47 (7) , 2821-2836
Convex polytopes of constant local multiset dimension with an application
- 31 July 2026
- Published by Taru Publications in Journal of Information and Optimization Sciences
- Vol. 47 (7) , 2821-2836
Convex polytopes of constant local multiset dimension with an application
- Open Access
- 18 April 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (12) , 1-14
Global Radio Labeling of Low-Diameter Transformation Graphs for Interference-Constrained Communication Networks
Radio labeling assigns positive integers to the vertices of a graph under separation constraints determined by vertex distances and graph diameter. Although this labeling scheme has been widely investigated for connected graphs, extensions to disconnected graphs and complementary graph structures remain limited. In this paper, we extend radio labeling to disconnected graphs by employing the maximum diameter among their components and introduce the notion of a global radio labeling, which requires a single labeling to satisfy radio constraints on both graph and its complement. The minimum span of such a labeling is defined as the global radio number. Transformation graphs of paths and cycles provide natural low-diameter models for layered network structures. Exact values of the global radio number are obtained for low-diameter transformation graphs of paths and cycles.
- 18 April 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (12) , 1-14
Open AccessGlobal Radio Labeling of Low-Diameter Transformation Graphs for Interference-Constrained Communication Networks
Radio labeling assigns positive integers to the vertices of a graph under separation constraints determined by vertex distances and graph diameter. Although this labeling scheme has been widely investigated for connected graphs, extensions to disconnected graphs and complementary graph structures remain limited. In this paper, we extend radio labeling to disconnected graphs by employing the maximum diameter among their components and introduce the notion of a global radio labeling, which requires a single labeling to satisfy radio constraints on both graph and its complement. The minimum span of such a labeling is defined as the global radio number. Transformation graphs of paths and cycles provide natural low-diameter models for layered network structures. Exact values of the global radio number are obtained for low-diameter transformation graphs of paths and cycles.
- Open Access
- 18 April 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (12) , 1-13
QSPR Analysis of Asthma Antibiotics Drugs Using 2-Distance Topological Indices
Topological indices serve as essential numerical descriptors of chemical compounds and are widely applied in QSPR/QSAR analysis. Since asthma remains a chronic respiratory disorder affecting millions worldwide, accurate modelling of asthma drugs can play a vital role in optimizing drug design and contributes to the development of more effective therapeutic strategies, potentially improving patient care and reducing the global burden of the disease. A study is conducted on a set of asthma antibiotic drugs by evaluating various 2-distance-based TIs. For few physicochemical properties, logarithmic regression models were developed using these TIs. The QSPR analysis demonstrated that the proposed models serve as effective predictors, highlighting the strong correlation between the molecular structure and drug properties.
- 18 April 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (12) , 1-13
Open AccessQSPR Analysis of Asthma Antibiotics Drugs Using 2-Distance Topological Indices
Topological indices serve as essential numerical descriptors of chemical compounds and are widely applied in QSPR/QSAR analysis. Since asthma remains a chronic respiratory disorder affecting millions worldwide, accurate modelling of asthma drugs can play a vital role in optimizing drug design and contributes to the development of more effective therapeutic strategies, potentially improving patient care and reducing the global burden of the disease. A study is conducted on a set of asthma antibiotic drugs by evaluating various 2-distance-based TIs. For few physicochemical properties, logarithmic regression models were developed using these TIs. The QSPR analysis demonstrated that the proposed models serve as effective predictors, highlighting the strong correlation between the molecular structure and drug properties.
- Open Access
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-10
Constant Local Multiset Dimension of Convex Polytopes-R_n and S_n
In graph theory, the metric dimension is a concept whose primary purpose is to uniquely identify each vertex in a graph based on distance with respect to a collection of reference vertices, called resolving sets. Resolving sets are used in communication networks to uniquely identify the position of each node. In robotics and navigation systems, robots can determine their exact position with reference to a set of codes generated by resolving set. Based on the practical requirements of the network problems, there are several variation in metric dimensions. Local multiset dimension (LMD) of a graph is one such variation, in which a local multiset basis generates a distinct multiset of distances for every pair of adjacent vertices with reference to a subset of the vertex set of the graph. Convex polytopes are the two-dimensional geometric shapes that can be used in designing an optimal network configuration. In this paper, we determined the LMD of two convex polytopes and hence found that the local multiset dimension for both the polytopes is constant, irrespective of the order of the graphs.
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-10
Open AccessConstant Local Multiset Dimension of Convex Polytopes-R_n and S_n
In graph theory, the metric dimension is a concept whose primary purpose is to uniquely identify each vertex in a graph based on distance with respect to a collection of reference vertices, called resolving sets. Resolving sets are used in communication networks to uniquely identify the position of each node. In robotics and navigation systems, robots can determine their exact position with reference to a set of codes generated by resolving set. Based on the practical requirements of the network problems, there are several variation in metric dimensions. Local multiset dimension (LMD) of a graph is one such variation, in which a local multiset basis generates a distinct multiset of distances for every pair of adjacent vertices with reference to a subset of the vertex set of the graph. Convex polytopes are the two-dimensional geometric shapes that can be used in designing an optimal network configuration. In this paper, we determined the LMD of two convex polytopes and hence found that the local multiset dimension for both the polytopes is constant, irrespective of the order of the graphs.
- Open Access
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-16
Gourava 2-Distance Degree Indices and QSPR Analysis of Alkanes
In mathematical chemistry, molecules are often represented as graphs and from these graphs, Topological indices(TIs) are derived, which are numerical values encoding structural information. TIs are introduced by Gutman and Trinajstić based on the degrees of the vertices and on distance between the vertices. QSPR analysis establishes correlations between TIs and measurable phisicochemical properties. In this paper, few generalized topological indices are defined using the 2-distance degree of the vertices. This extension seeks to offer a more thorough understanding of network structures by capturing deeper connectivity patterns. The findings contribute to a better understanding of structure-property relationships in alkanes and can serve as a tool for predicting the properties of other alkanes based on their molecular structures.
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-16
Open AccessGourava 2-Distance Degree Indices and QSPR Analysis of Alkanes
In mathematical chemistry, molecules are often represented as graphs and from these graphs, Topological indices(TIs) are derived, which are numerical values encoding structural information. TIs are introduced by Gutman and Trinajstić based on the degrees of the vertices and on distance between the vertices. QSPR analysis establishes correlations between TIs and measurable phisicochemical properties. In this paper, few generalized topological indices are defined using the 2-distance degree of the vertices. This extension seeks to offer a more thorough understanding of network structures by capturing deeper connectivity patterns. The findings contribute to a better understanding of structure-property relationships in alkanes and can serve as a tool for predicting the properties of other alkanes based on their molecular structures.
- Open Access
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-12
On Distance-Based Arithmetic Radio Number of Standard Graph Classes
Let k ∈ Z+and let G = (V,E) be a connected graph of order n. An arithmetic k-radio labelingis a bijection η : V →{1, 1 + k, 1 + 2k,..., 1 + (n− 1)k} such that for any two distinct vertices u,v ∈ V , the condition |η(u)− η(v)| > diam(G)− dist(u,v) is satisfied. The least such k is defined as the arithmetic radio number of G, denoted by Ra(G). In this paper, we establish exact values of Ra(G) for several families of graphs, including paths, cycles, squares of paths, and the join of graphs. Our results contribute to the broader context of distance-constrained labeling by combining structural graph properties with arithmetic progressions in labeling.
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-12
Open AccessOn Distance-Based Arithmetic Radio Number of Standard Graph Classes
Let k ∈ Z+and let G = (V,E) be a connected graph of order n. An arithmetic k-radio labelingis a bijection η : V →{1, 1 + k, 1 + 2k,..., 1 + (n− 1)k} such that for any two distinct vertices u,v ∈ V , the condition |η(u)− η(v)| > diam(G)− dist(u,v) is satisfied. The least such k is defined as the arithmetic radio number of G, denoted by Ra(G). In this paper, we establish exact values of Ra(G) for several families of graphs, including paths, cycles, squares of paths, and the join of graphs. Our results contribute to the broader context of distance-constrained labeling by combining structural graph properties with arithmetic progressions in labeling.
- Open Access
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-11
Certain Variants of Neighborhood Number of Wheel Related Graphs
The concept of neighborhood number in a graph has broad applications across various fields. It quantifies how effectively a subset of vertices can collectively cover the entire network. For instance, in social network system the neighborhood number can be used to determine the sets of influential users whose immediate connections facilitate efficient information dissemination throughout the network. In a graph G, a subset S of V(G) is said to be neighborhood set (n-set), if the union of sub graphs of G induced by the closed neighbors of elements in S produces graph G. The minimum cardinality of a minimal neighborhood set of G is called the neighborhood number of a graph G, denoted by n(G). The structure of wheel graph is instrumental for designing, managing and analyzing systems where a central entity directly connects to all others, optimizing various practical tasks in real life. This paper aims to explore some variants of neighborhood sets and their dimensions of certain wheel related graphs.
- 3 February 2026
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 44 (4) , 1-11
Open AccessCertain Variants of Neighborhood Number of Wheel Related Graphs
The concept of neighborhood number in a graph has broad applications across various fields. It quantifies how effectively a subset of vertices can collectively cover the entire network. For instance, in social network system the neighborhood number can be used to determine the sets of influential users whose immediate connections facilitate efficient information dissemination throughout the network. In a graph G, a subset S of V(G) is said to be neighborhood set (n-set), if the union of sub graphs of G induced by the closed neighbors of elements in S produces graph G. The minimum cardinality of a minimal neighborhood set of G is called the neighborhood number of a graph G, denoted by n(G). The structure of wheel graph is instrumental for designing, managing and analyzing systems where a central entity directly connects to all others, optimizing various practical tasks in real life. This paper aims to explore some variants of neighborhood sets and their dimensions of certain wheel related graphs.
- 24 January 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (01)
On the local multiset dimension of a graph
In robot navigation, the concept of local multiset in graph theory can be used to calculate the minimum number of sensors required to uniquely identify each point in a network. By modeling every point in the network into a vertex and their connections into edges, the solution lies in determining the minimum number of reference points necessary to identify every point in the network uniquely. Based on the distances between vertices, local multiset dimension (LMD) quantifies the minimum required number of vertices to define the unique position of every vertex in the graph. By strategically placing sensors at these reference points in a given network, LMD helps the robot map its environment and determine its location based solely on its distances to these reference points. Interest in this area of graph theory has increased in recent years. In this paper, some characterizations of the local multiset basis are discussed and extended to some graphs derived from path.
- 24 January 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (01)
On the local multiset dimension of a graph
In robot navigation, the concept of local multiset in graph theory can be used to calculate the minimum number of sensors required to uniquely identify each point in a network. By modeling every point in the network into a vertex and their connections into edges, the solution lies in determining the minimum number of reference points necessary to identify every point in the network uniquely. Based on the distances between vertices, local multiset dimension (LMD) quantifies the minimum required number of vertices to define the unique position of every vertex in the graph. By strategically placing sensors at these reference points in a given network, LMD helps the robot map its environment and determine its location based solely on its distances to these reference points. Interest in this area of graph theory has increased in recent years. In this paper, some characterizations of the local multiset basis are discussed and extended to some graphs derived from path.
- Open Access
- 18 January 2024
- Published by MDPI AG in Engineering Proceedings
- Vol. 59 (1) , 180
Rational Wiener Index and Rational Schultz Index of Graphs
In this research paper, we investigate fundamental graph properties within the context of a simple connected graph denoted as G = (V, E). We introduce the concept of the rational Schultz index. In the context of this paper, our main objective is to calculate the rational Wiener index and rational Schultz index for a specific class of graphs. Our focus lies in the analysis and computation of these indices within this particular graph family.
- 18 January 2024
- Published by MDPI AG in Engineering Proceedings
- Vol. 59 (1) , 180
Open AccessRational Wiener Index and Rational Schultz Index of Graphs
In this research paper, we investigate fundamental graph properties within the context of a simple connected graph denoted as G = (V, E). We introduce the concept of the rational Schultz index. In the context of this paper, our main objective is to calculate the rational Wiener index and rational Schultz index for a specific class of graphs. Our focus lies in the analysis and computation of these indices within this particular graph family.
- Open Access
- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1311-1323
Restrained and Total Restrained Domination of Ladder Graphs
Telle and Proskurowksi introduced restrained domination as a vertex partition problem in partial \(k\)-tress (Algorithms for vertex partitioning problems on partial \(k\)-trees, SIAM Journal on Discrete Mathematics 10(4) (1997), 529 - 550). For a graph \(G(V,E)\), a restrained domination number is the minimum cardinality of a subset \(\mathfrak{D}\) of \(V\) such that for every vertex \(v\in \bar{\mathfrak{D}}\) there is a vertex in \(\mathfrak{D}\) as well as in \(\bar{\mathfrak{D}}\) adjacent to \(v\). If \(\mathfrak{D}\) satisfies an additional condition that every vertex of \(V\) has a neighbor in \(\mathfrak{D}\), then \(\mathfrak{D}\) is said to be a total restrained dominating set. Minimum cardinality of \(\mathfrak{D}\) is said to be total restrained domination number of graph \(G\). In this paper we have obtained domination, restrained, total and total restrained domination number of some ladder graphs.- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1311-1323
Open AccessRestrained and Total Restrained Domination of Ladder Graphs
Telle and Proskurowksi introduced restrained domination as a vertex partition problem in partial \(k\)-tress (Algorithms for vertex partitioning problems on partial \(k\)-trees, SIAM Journal on Discrete Mathematics 10(4) (1997), 529 - 550). For a graph \(G(V,E)\), a restrained domination number is the minimum cardinality of a subset \(\mathfrak{D}\) of \(V\) such that for every vertex \(v\in \bar{\mathfrak{D}}\) there is a vertex in \(\mathfrak{D}\) as well as in \(\bar{\mathfrak{D}}\) adjacent to \(v\). If \(\mathfrak{D}\) satisfies an additional condition that every vertex of \(V\) has a neighbor in \(\mathfrak{D}\), then \(\mathfrak{D}\) is said to be a total restrained dominating set. Minimum cardinality of \(\mathfrak{D}\) is said to be total restrained domination number of graph \(G\). In this paper we have obtained domination, restrained, total and total restrained domination number of some ladder graphs.