Edge irregularity strength of uniform theta graphs, generalized 4-prism graphs, and its applications in communication networks
- 23 October 2025
- journal article
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (09)
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- On edge irregularity strength of cycle-star graphsProyecciones (Antofagasta), 2024
- Vertex k-Prime Labeling of Theta GraphsIndian Journal of Science and Technology, 2023
- A note on edge irregularity strength of firefly graphNotes on Number Theory and Discrete Mathematics, 2023
- Distinguishing Number of the Generalized Theta Graph2022
- On edge irregularity strength of line graph and line cut-vertex graph of comb graphNotes on Number Theory and Discrete Mathematics, 2022
- On total edge irregularity strength of centralized uniform theta graphsAKCE International Journal of Graphs and Combinatorics, 2018
- Applications of Laplacian spectra for n-prism networksNeurocomputing, 2016
- Rule Extraction For Blood Donators With Fuzzy Sequential Pattern MiningJournal of Mathematics and Computer Science, 2011
- On irregular total labellingsDiscrete Mathematics, 2007