Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Shahzad et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: