On edge irregularity strength of certain families of snake graph

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

On edge irregularity strength of certain families of snake graph

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

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	92-101
Number of pages	10
Journal	Journal of Prime Research in Mathematics
Volume	19
Issue number	1
Publication status	Published - 2023
Externally published	Yes

Keywords

Edge irregularity strength
irregular assignment
irregularity strength
pendant edge
snake graphs

ASJC Scopus subject areas

Mathematics(all)

Cite this

@article{d01282604ff441369fe67e9f3160b38a,

title = "On edge irregularity strength of certain families of snake graph",

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.",

keywords = "Edge irregularity strength, irregular assignment, irregularity strength, pendant edge, snake graphs",

author = "Nadeem, {Muhammad Faisal} and Murat Cancan and Muhammad Imran and Yasir Ali",

year = "2023",

language = "English",

volume = "19",

pages = "92--101",

journal = "Journal of Prime Research in Mathematics",

issn = "1817-3462",

publisher = "Abdus Salam School of Mathematical Sciences, GC University",

number = "1",

}

TY - JOUR

T1 - On edge irregularity strength of certain families of snake graph

AU - Nadeem, Muhammad Faisal

AU - Cancan, Murat

AU - Imran, Muhammad

AU - Ali, Yasir

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

KW - Edge irregularity strength

KW - irregular assignment

KW - irregularity strength

KW - pendant edge

KW - snake graphs

UR - http://www.scopus.com/inward/record.url?scp=85175197404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85175197404&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85175197404

SN - 1817-3462

VL - 19

SP - 92

EP - 101

JO - Journal of Prime Research in Mathematics

JF - Journal of Prime Research in Mathematics

IS - 1

ER -

On edge irregularity strength of certain families of snake graph

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this