# ON THE IRREGULARITY STRENGTH AND MODULAR IRREGULARITY STRENGTH OF FRIENDSHIP GRAPHS AND ITS DISJOINT UNION

• Fredrylo Alberth Noel Joddy Apituley Pattimura University
• Mozart W. Talakua Department of Mathematics, Faculty of Science and Mathematics, Pattimura University
• Yopi Andry Lesnussa Department of Mathematics, Faculty of Science and Mathematics, Pattimura University https://orcid.org/0000-0002-8729-3437
Keywords: Irregularity Strength, Modular Irregularity Strength, Friendship Graphs, Disjoint union of graphs

### Abstract

For a simple, undirected graph G with, at most one isolated vertex and no isolated edges, a labeling f:E(G)→{1,2,…,k1} of positive integers to the edges of G is called irregular if the weights of each vertex of G has a different value. The integer k1 is then called the irregularity strength of G. If the number of vertices in G or the order of G is |G|, then the labeling μ:E(G)→{1,2,…,k2}  is called modular irregular if the remainder of the weights of each vertex of G divided by |G| has a different value. The integer k2 is then called the modular irregularity strength of G. The disjoint union of two or more graphs, denoted by ‘+’, is an operation where the vertex and edge set of the result each be the disjoint union of the vertex and edge sets of the given graphs. This study discusses about the irregularity and modular irregularity strength of friendship graphs and some of its disjoint union, The result given is s(Fm ) = m + 1, ms(Fm ) = m + 1 and ms(rFm ) = rm + ⌈r/2⌉, where r denotes the number of copies of friendship graphs

### References

A. Gibbons, Algorithmic Graph Theory, Cambridge, England: Cambridge University Press, 1985.

D. B. West, Introduction to Graph Theory, 2nd ed., NJ: Englewood Cliffs, 2000.

I. N. Bronshtein and K. A. Semendyayev, Handbook of Mathematics, 4th ed., New York: Springer-Verlag, 2004.

A. Rosa, “On certain valuations of the vertices of a graph.,” Theory of Graphs Internat. Sympos.,, pp. 349-355, 1967.

E. W. Weisstein, “Labeled Graph,” [Online]. Available: https://mathworld.wolfram.com/LabeledGraph.html. [Accessed 19 December 2021].

M. Baca, S. Jendrol, M. Miller and J. Ryan, “On Irregular Total Labelings,” Discrete Mathematics, vol. 307, no. 11, pp. 1378-1388, 2007.

G. Chartrand, M. Jacobon, J. Lehel, O. Oellerman, S. Ruiz and S. Farrokh, “Irregular Networks,” Congr. Numer., p. 64, 1986.

K. H. Rosen, Handbook of Discrete and Combinatorial Mathematics, CRC Press, 1999.

R. J. Trudeau, “Introduction to Graph Theory,” in Introduction to Graph Theory, New York, Dover Publication, 1993, p. 64.

M. Barthelemy, “Morphogenesis of Spatial Networks,” in Morphogenesis of Spatial Networks, New York:, Springer, 2017, p. 6.

O. Togni, “Irregularity strength of the toroidal grid,” Discrete Math, vol. 165/166, p. 609–620, 1997.

T. Bohman and K. D., “On the irregularity strength of trees,” J. Graph Theory, vol. 45, no. 4, p. 241–254, 2004.

A. Ahmad, M. Baca and M. Numan, “On irregularity strength of disjoint union of friendship graphs,” Electronic Journal of Graph Theory and Applications, vol. 1, no. 2, pp. 100-108, 2018.

M. I. Tilukay, “The Modular Irregularity Strength of Triangular Book Graphs,” Tensor : Pure and Applied Mathematics Journal, vol. 2, no. 2, pp. 53-58, 2021.

ISGCI, “List of small graphs,” [Online]. Available: https://www.graphclasses.org/smallgraphs.html#butterfly. [Accessed 19 December 2021].

Published
2022-09-01
How to Cite
[1]
F. Apituley, M. Talakua, and Y. Lesnussa, “ON THE IRREGULARITY STRENGTH AND MODULAR IRREGULARITY STRENGTH OF FRIENDSHIP GRAPHS AND ITS DISJOINT UNION”, BAREKENG: J. Math. & App., vol. 16, no. 3, pp. 869-876, Sep. 2022.
Section
Articles