TY - JOUR

T1 - Irregularity and modular irregularity strength of wheels

AU - Bača, Martin

AU - Imran, Muhammad

AU - Semaničová-Feňovčíková, Andrea

N1 - Funding Information:
Funding: This research was supported by the Asian Universities Alliance (AUA) Grant of United Arab Emirates University (UAEU), Al Ain, UAE via Grant No G00003461. This work was also supported by the Slovak Research and Development Agency under Contract No. APVV-19-0153 and by VEGA 1/0233/18.
Publisher Copyright:
© 2021 by the authors. Licensee MDPI, Basel, Switzerland.

PY - 2021/11/1

Y1 - 2021/11/1

N2 - It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. This means that no simple graph of the order of at least two is, in this way, irregular. However, a multigraph can be irregular. Chartrand et al., in 1988, posed the following problem: in a loopless multigraph, how can one determine the fewest parallel edges required to ensure that all vertices have distinct degrees? This problem is known as the graph labeling problem and, for its solution, Chartrand et al. introduced irregular assignments. The irregularity strength of a graph G is known as the maximal edge label used in an irregular assignment, minimized over all irregular assignments. Thus, the irregularity strength of a simple graph G is equal to the smallest maximum multiplicity of an edge of G in order to create an irregular multigraph from G. In the present paper, we show the existence of a required irregular labeling scheme that proves the exact value of the irregularity strength of wheels. Then, we modify this irregular mapping in six cases and obtain labelings that determine the exact value of the modular irregularity strength of wheels as a natural modification of the irregularity strength.

AB - It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. This means that no simple graph of the order of at least two is, in this way, irregular. However, a multigraph can be irregular. Chartrand et al., in 1988, posed the following problem: in a loopless multigraph, how can one determine the fewest parallel edges required to ensure that all vertices have distinct degrees? This problem is known as the graph labeling problem and, for its solution, Chartrand et al. introduced irregular assignments. The irregularity strength of a graph G is known as the maximal edge label used in an irregular assignment, minimized over all irregular assignments. Thus, the irregularity strength of a simple graph G is equal to the smallest maximum multiplicity of an edge of G in order to create an irregular multigraph from G. In the present paper, we show the existence of a required irregular labeling scheme that proves the exact value of the irregularity strength of wheels. Then, we modify this irregular mapping in six cases and obtain labelings that determine the exact value of the modular irregularity strength of wheels as a natural modification of the irregularity strength.

KW - (Modular) irregularity strength

KW - Irregular assignment

KW - Wheel

UR - http://www.scopus.com/inward/record.url?scp=85118236275&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85118236275&partnerID=8YFLogxK

U2 - 10.3390/math9212710

DO - 10.3390/math9212710

M3 - Article

AN - SCOPUS:85118236275

SN - 2227-7390

VL - 9

JO - Mathematics

JF - Mathematics

IS - 21

M1 - 2710

ER -