Answers are grounded in this paper and cite their sources.
Theoretical analysis determines the face irregular strength in grid graphs, establishing exact minimum bounds for face irregular labelings.
Let G=(V,E,F) be a connected plane graph. Let ρ:α(V)∪β(E)∪γ(F)→{1,2,…,k} be a k-labeling where α,β,γ∈{0,1} and (α,β,γ)≠(0,0,0). The weight of a face f under ρ is defined as Wt(f)=α∑v∼fρ(v)+β∑e∼fρ(e)+γρ(f). Then ρ is called a face irregular labeling of type (α,β,γ) if Wt(f)≠Wt(g) for any two faces f≠g. The face irregular strength of G is the smallest integer k such that G admits a face irreg ular k-labeling. In this paper we determine the face irregular strength of the grid graph Pn+1□Pm+1 under a labeling of type (α,β,γ).
No takes yet. Share an insight, caveat, or question.
Bayati et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: