Answers are grounded in this paper and cite their sources.
In this study, we used grids and wheel graphs <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:mi>G</a:mi> <a:mo>=</a:mo> <a:mfenced open="(" close=")" separators="|"> <a:mrow> <a:mi>V</a:mi> <a:mo>,</a:mo> <a:mi>E</a:mi> <a:mo>,</a:mo> <a:mi>F</a:mi> </a:mrow> </a:mfenced> </a:math> , which are simple, finite, plane, and undirected graphs with <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" id="M2"> <f:mi>V</f:mi> </f:math> as the vertex set, <h:math xmlns:h="http://www.w3.org/1998/Math/MathML" id="M3"> <h:mi>E</h:mi> </h:math> as the edge set, and <j:math xmlns:j="http://www.w3.org/1998/Math/MathML" id="M4"> <j:mi>F</j:mi> </j:math> as the face set. The article addresses the problem to find the face irregularity strength of some families of generalized plane graphs under <l:math xmlns:l="http://www.w3.org/1998/Math/MathML" id="M5"> <l:mi>k</l:mi> </l:math> -labeling of type <n:math xmlns:n="http://www.w3.org/1998/Math/MathML" id="M6"> <n:mfenced open="(" close=")" separators="|"> <n:mrow> <n:mi>α</n:mi> <n:mo>,</n:mo> <n:mi>β</n:mi> <n:mo>,</n:mo> <n:mi>γ</n:mi> </n:mrow> </n:mfenced> </n:math> . In this labeling, a graph is assigning positive integers to graph vertices, graph edges, or graph faces. A minimum integer <s:math xmlns:s="http://www.w3.org/1998/Math/MathML" id="M7"> <s:mi>k</s:mi> </s:math> for which a total label of all verteices and edges of a plane graph has distinct face weights is called <u:math xmlns:u="http://www.w3.org/1998/Math/MathML" id="M8"> <u:mi>k</u:mi> </u:math> -labeling of a graph. The integer <w:math xmlns:w="http://www.w3.org/1998/Math/MathML" id="M9"> <w:mi>k</w:mi> </w:math> is named as total face irregularity strength of the graph and denoted as <y:math xmlns:y="http://www.w3.org/1998/Math/MathML" id="M10"> <y:mtext>tfs</y:mtext> <y:mfenced open="(" close=")" separators="|"> <y:mrow> <y:mi>G</y:mi> </y:mrow> </y:mfenced> </y:math> . We also discussed a special case of total face irregularity strength of plane graphs under <db:math xmlns:db="http://www.w3.org/1998/Math/MathML" id="M11"> <db:mi>k</db:mi> </db:math> -labeling of type (1, 1, 0). The results will be verified by using figures and examples.
No takes yet. Share an insight, caveat, or question.
Mughal et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: