2024
DOI: 10.47836/mjms.18.3.10
|View full text |Cite
|
Sign up to set email alerts
|

Computing the Edge Irregularity Strength of Some Classes of Grid Graphs

M. Shahzad,,
R. Hasni,,
I. Tarawneh,
et al.

Abstract: Let G be a simple graph. A function ϕ:V(G)→{1,2,…,k} a vertex k-labeling which assigns labels to the vertices of G. For any edge xy in G, we define the weight of this edge as wϕ(xy)=ϕ(x)+ϕ(y). If all the edge weights are distinct, then ϕ is termed as an edge irregular k -labeling of G. The smallest possible value of k for which the graph G possesses an edge irregular k-labeling is denoted as the edge irregularity strength of G and is represented as es(G). In this paper, we investigate the edge irregular k-labe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 9 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?