On edge irregularity strength of different families of graphs

Creative Commons License

Imran M., Cancan M., Ali Y., Anum A., Aslam J.

Proyecciones, cilt.42, sa.6, ss.1549-1566, 2023 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42 Sayı: 6
  • Basım Tarihi: 2023
  • Doi Numarası: 10.22199/issn.0717-6279-5873
  • Dergi Adı: Proyecciones
  • Derginin Tarandığı İndeksler: Scopus, Academic Search Premier, Fuente Academica Plus, zbMATH, DIALNET
  • Sayfa Sayıları: ss.1549-1566
  • Anahtar Kelimeler: Bn graph, edge irregularity strength, Irregular assignment, irregularity strength, linear phenylene graph PHn, pendant edges, snake graphs
  • Van Yüzüncü Yıl Üniversitesi Adresli: Evet

Özet

Edge irregular mapping or vertex mapping h: V (G) −→ {1, 2, 3, …, s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c) + h(d), ∀c, d ∈ V (G) and ∀cd ∈ E(G). Edge irregularity strength denoted by es(G) is a minimum positive integer used to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of linear phenylene graph PHn, Bn graph and different families of snake graph.