On edge irregularity strength of certain families of snake graph

Muhammad Faisal Nadeem, Murat Cancan, Muhammad Imran, Yasir Ali

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)92-101
Number of pages10
JournalJournal of Prime Research in Mathematics
Volume19
Issue number1
Publication statusPublished - 2023
Externally publishedYes

Keywords

  • Edge irregularity strength
  • irregular assignment
  • irregularity strength
  • pendant edge
  • snake graphs

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'On edge irregularity strength of certain families of snake graph'. Together they form a unique fingerprint.

Cite this