Edge reflexive irregularity strength of mk -graph of path graph
Abstract
In graph theory we define the total labeling, such that the edge labels and vertex labels are positive integers and even integers respectively and for different edges we have distinct weights, whereas the weight of an edge is the sum of labels of that edge and adjacent vertices, then labeling is referred as edge irregular reflexive total labeling. In this paper we calculated the exact values of reflexive edge irregularity strength for mk-graph of path graph mPn for k = 1 with n ≥ 3, m ≥ 4.
Fields of Study & Subjects
Graph Labeling and Dimension Problems
Digital Image Processing Techniques
Advanced Graph Theory Research
Publication details
- Journal / source
- Journal of Information and Optimization Sciences
- Volume
- 47
- Issue
- 1
- Pages
- 235–250
- Publication date
- 1 January 2026