Year: 2024
Type: article
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-labeling of some classes of grid graphs, namely rhombic graph Rmn, triangular graph Lmn and octagonal graph Omn. As by-product, we obtain their precise value of edge irregularity strength.
Authors: M. Shahzad,, R. Hasni,, I. Tarawneh,, M. A. Asim,
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4403043039