Umme Salma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Umme Salma has a total of 6 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
4 shared publications - D. Prahlad
Professor, Department of Electronics and Communication Engineering, PES University, Karnataka, Bangalore, India
1 shared publication Narahari N
1 shared publication- Narahari Narasimha Swamy
Department of Mathematics, University College of Science, Tumkuru University, Tumakuru, India
1 shared publication - U. Vijaya Chandra Kumar
Department of Mathematics, School of Applied Sciences, REVA University, Bangalore, India
1 shared publication - Uppari Vijaya Chandra Kumar
Department of Mathematics, School of Applied Sciences, REVA University, Bengaluru, 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
- 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
On edge irregularity strength of cycle-star graphs
For a simple graph $G$, a vertex labeling $φ:V(G) \rightarrow \{1, 2,\ldots,k\}$ is called $k$-labeling. The weight of an edge $uv$ in $G$, written $w_φ(uv)$, is the sum of the labels of end vertices $u$ and $v$, i.e., $w_φ(uv)=φ(u)+φ(v)$. A vertex $k$-labeling is defined to be an edge irregular $k$-labeling of the graph $G$ if for every two distinct edges $u$ and $v$, $w_φ(u) \neq w_φ(v)$. The minimum $k$ for which the graph $G$ has an edge irregular $k$-labeling is called the edge irregularity strength of $G$, written $es(G)$. In this paper, we study the edge irregular $k$-labeling for cycle-star graph $CS_{k,n-k}$ and determine the exact value for cycle-star graph for $3 \leq k \leq 7$ and $n-k \geq 1$. Finally, we make a conjecture for the edge irregularity strength of $CS_{k,n-k}$ for $k \geq 8$ and $n-k \geq 1$.Open AccessOn edge irregularity strength of cycle-star graphs
For a simple graph $G$, a vertex labeling $φ:V(G) \rightarrow \{1, 2,\ldots,k\}$ is called $k$-labeling. The weight of an edge $uv$ in $G$, written $w_φ(uv)$, is the sum of the labels of end vertices $u$ and $v$, i.e., $w_φ(uv)=φ(u)+φ(v)$. A vertex $k$-labeling is defined to be an edge irregular $k$-labeling of the graph $G$ if for every two distinct edges $u$ and $v$, $w_φ(u) \neq w_φ(v)$. The minimum $k$ for which the graph $G$ has an edge irregular $k$-labeling is called the edge irregularity strength of $G$, written $es(G)$. In this paper, we study the edge irregular $k$-labeling for cycle-star graph $CS_{k,n-k}$ and determine the exact value for cycle-star graph for $3 \leq k \leq 7$ and $n-k \geq 1$. Finally, we make a conjecture for the edge irregularity strength of $CS_{k,n-k}$ for $k \geq 8$ and $n-k \geq 1$. - Open Access
- 22 March 2023
- Published by Prof. Marin Drinov Publishing House of BAS (Bulgarian Academy of Sciences) in Notes on Number Theory and Discrete Mathematics
- Vol. 29 (1) , 147-153
A note on edge irregularity strength of firefly graph
- 22 March 2023
- Published by Prof. Marin Drinov Publishing House of BAS (Bulgarian Academy of Sciences) in Notes on Number Theory and Discrete Mathematics
- Vol. 29 (1) , 147-153
Open AccessA note on edge irregularity strength of firefly graph