**H. M. Nagesh and V. R. Girish**

Notes on Number Theory and Discrete Mathematics

Print ISSN 1310–5132, Online ISSN 2367–8275

Volume 28, 2022, Number 3, Pages 517–524

DOI: 10.7546/nntdm.2022.28.3.517-524

**Full paper (PDF, 172 Kb)**

## Details

### Authors and affiliations

H. M. Nagesh

*Department of Science & Humanities, PES University
Electronic City Campus, Hosur Road, Bangalore – 560 100, India
*

V. R. Girish

*Department of Science & Humanities, PES University
Electronic City Campus, Hosur Road, Bangalore – 560 100, India
*

### Abstract

For a simple graph , a vertex labeling is called -labeling. The weight of an edge in , written , is the sum of the labels of end vertices and , i.e., . A vertex -labeling is defined to be an edge irregular -labeling of the graph if for every two different edges and , . The minimum for which the graph has an edge irregular -labeling is called the edge irregularity strength of , written . In this paper, we find the exact value of edge irregularity strength of line graph of comb graph for ; and determine the bounds for . Also, the edge irregularity strength of line cut-vertex graph of for ; and determine the bounds for .

### Keywords

- Irregular assignment
- Irregularity strength
- Irregular total -labeling
- Edge irregularity strength
- Comb graph

### 2020 Mathematics Subject Classification

- 05C38
- 05C78

### References

- Ahmad, A., Ashok, G., & Rinovia, S. (2018). Computing the edge irregularity strengths of chain graphs and the join of two graphs.
*Electronic Journal of Graph Theory and**Applications*, 6(1), 201–207. - Ahmad, A., Bača, M., Bashir, Y., & Siddiqui, M. K. (2012). Total edge irregularity strength of strong product of two paths.
*Ars Combinatoria*, 106, 449–459. - Ahmad, A., Bača, M., & Siddiqui, M. K. (2014). On edge irregular total labeling of

categorical product of two cycles.*Theory of Computing Systems*, 54, 1–12. - Ahmad, A., Al-Mushayt, O., & Bača, M. (2014). On edge irregularity strength of graphs.
*Applied Mathematics and Computation*, 243, 607–610. - Ahmad, A., Siddiqui, M. K., & Afzal, D. (2012). On the total edge irregularity strength of zigzag graphs.
*Australasian Journal of Combinatorics*, 54, 141–149. - Ahmad, A., Bača, M., & Nadeem, M. F. (2016). On the edge irregularity strength of Toeplitz graphs.
*Scientific Bulletin-University Politehnica of Bucharest*, 78, 155–162. - Ahmad, A., Al-Mushayt, O., & Siddiqui, M. K. (2012). On the total edge irregularity strength of hexagonal grid graphs.
*Australasian Journal of Combinatorics*, 53, 263–271. - Bača, M., Jendrol, S., Miller, M., & Ryan, J. (2007). On irregular total labellings.
*Discrete Mathematics*, 307, 1378–1388. - Bača, M., & Siddiqui, M. K. (2014). Total edge irregularity strength of generalized prism.
*Applied Mathematics and Computation*, 235, 168–173. - Chartrand, G., Jacobson, M. S., Lehel, J., Oellermann, O. R., & Saba, F. (1988). Irregular networks.
*Congressus Numerantium*, 64, 187–192. - Frieze, A., Gould, R. J., Karonski, M., & Finder, F. (2002). On graph irregularity strength.
*Journal of Graph Theory*, 41, 120–137. - Gallian, J. A. (2019). A dynamic survey graph labeling.
*Electronic Journal of*

*Combinatorics*, 19, 1–553. - Kulli, V. R., Muddebihal, M. H. (1975). On lict and litact graph of a graph.
*Proceeding of the Indian National Science Academy*, 41, 275–280. - Tarawneh, I., Hasni, R., & Ahmad, A. (2016). On the edge irregularity strength of corona product of graphs with paths.
*Applied Mathematics E-Notes*, 16, 80–87. - Tarawneh, I., Hasni, R., & Ahmad, A. (2016). On the edge irregularity strength of

corona product of cycle with isolated vertices.*AKCE International Journal of Graphs and Combinatorics*, 13, 213–217. - Tarawneh, I., Hasni, R., Ahmad, A., & Lau, G. C. (2020). On the edge irregularity strength of corona product of graphs with cycle.
*Discrete Mathematics, Algorithms and Applications*, 12(6), Article ID 2050083. - Tarawneh, I., Hasni, R., & Asim, M. A. (2018). On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.
*Ars Combinatoria*, 141, 93–100. - Tarawneh, I., Hasni, R., Asim, M. A., & Siddiqui, M. A. (2019). On the edge irregularity strength of disjoint union of graphs.
*Ars Combinatoria*, 142, 239–249. - Zhang, X., Cancan, M., Nadeem, M. F., & Imran, M. (2020). Edge irregularity strength of certain families of comb graph.
*Proyecciones (Antofagasta. On line)*, 39(4), 787–797.

### Manuscript history

- Received: 4 March 2022
- Revised: 2 August 2022
- Accepted: 4 August 2022
- Online First: 10 August 2022

## Related papers

## Cite this paper

Nagesh, H. M, & Girish, V. R. (2022). On edge irregularity strength of line graph and line cut-vertex graph of comb graph. *Notes on Number Theory and Discrete Mathematics*, 28(3), 517-524, DOI: 10.7546/nntdm.2022.28.3.517-524.