On edge irregularity strength of certain families of snake graph

Authors

  • Muhammad Faisal Nadeem Department of Mathematics, Comsats University Islamabad, Lahore Campus, Pakistan.
  • Murat Cancan Faculty of Education, Yuzuncu Yil University, van, Turkey.
  • Muhammad Imran Department of Mathematics, Concordia College Kasur Campus, Pakistan.
  • Yasir Ali Department of Mathematics, Concordia College Kasur Campus, Pakistan.

Keywords:

Edge irregularity strength, irregular assignment, irregularity strength, pendant edge, snakegraphs

Abstract

Edge irregular mapping or vertex mapping β : V (U) → {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 wtβ(cd) = β(c)+β(d), ∀c, d ∈ V (U) and cd ∈ E(U). Edge irregularity strength denoted by es(U) is a minimum positive integer used to label vertices to form edge irregular labeling. The aim of this paper is to determine the exact value of edge irregularity strength of different families of snake graph.

Downloads

Download data is not yet available.

Downloads

Published

2023-06-30

How to Cite

On edge irregularity strength of certain families of snake graph. (2023). Journal of Prime Research in Mathematics, 19(1), 92 – 101. https://jprm.sms.edu.pk/index.php/jprm/article/view/211