Further results on edge irregularity strength of some graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-6175Keywords:
irregular assignment, irregularity strength, edge irregularity strength, splitting graph, shadow graph, jewel graph, jellyfish graph, 4-Pan graphAbstract
The focal point of this paper is to precisely ascertain the edge irregularity strength of various finite, simple, and undirected captivating graphs, including splitting graph, shadow graph, jewel graph, jellyfish graph, and $m$ copies of 4-pan graph.
References
A. Ahmad, A. Gupta and R. Simanjuntak, “Computing the edge irregularity strengths of chain graphs and the join of two graphs”, Electronic Journal of Graph Theory and Applications, Vol. 6, No. 1, pp. 201-207, 2018.
D. Amar and O. Togni, “Irregularity strength of trees”, Discrete Mathematics, Vol. 190, No. 1-3, pp. 15-38, Aug. 1998.
A. Ahmad, O. B. S. Al-Mushayt and M. Baca, “On edge irregularity strength of graphs”, Applied Mathematics and Computation, Vol. 243, pp. 607-610, Sep. 2014.
A. Ahmad, M. Baca and M. K. Siddiqui, “On Edge Irregular Total Labeling of Categorical Product of Two Cycles”, Theory of Computing Systems, Vol. 54, No. 1, pp. 1-12, Apr. 2013.
A. Ahmad, M. Baca and M. F. Nadeem, “On edge irregularity strength of Toeplitz graphs”, UPB Scientific Bulletin, Series A: Applied Mathematics and Physics, Vol. 78, No. 4, pp. 155-162, 2016.
A. Ahmad, M. Baca, Y. Bashir and M. K. Siddiqui, “Total edge irregularity strength of strong product of two paths”, Ars combinatoria, Vol. 106, pp. 449-459, 2012.
M. Anholcer, M. Kalkowski and J. Przybylo, “A new upper bound for the total vertex irregularity strength of graphs”, Discrete Mathematics, Vol. 309, No. 21, pp. 6316-6317, Nov. 2009.
O. S. Al-Mushayt, “On edge irregularity strength of products of certain families of graphs with path P2”, Ars combinatoria, Vol. 135, pp. 323-334, 2017
O. B. S. Al-Mushayt, A. Ahmad and M. K. Siddiqui, “On the total edge irregularity strength of hexagonal grid graphs”, Australas. J Comb., Vol. 53, pp. 263-272, 2012.
T. Bohman and D. Kravitz, “On the irregularity strength of trees”, Journal of Graph Theory, Vol. 45, No. 4, pp. 241-254, 2004.
M. Baca and M. K. Siddiqui, “Total edge irregularity strength of generalized prism”, Applied Mathematics and Computation, Vol. 235, pp. 168-173, 2014.
M. Baca, S. Jendrol, M. Miller and J. Ryan, “On irregular total labellings”, Discrete Mathematics, Vol. 307, No. 11-12, pp. 1378-1388, 2007.
G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz and F. Saba, “Irregular networks”, Congr. Numer, Vol. 64, pp 187-192, 1988.
A. Frieze, R. J. Gould, M. Karonski and F. Pfender, “On graph irregularity strength”, Journal of Graph Theory, Vol. 41, No. 2, pp. 120-137, 2002.
J. A. Gallian, “A Dynamic Survey of Graph Labeling”, The Electronic Journal of Combinatorics, (2022, 25th edition), pp. 1-623. https://doi.org/10.37236/27
K. M. M. Haque, “Irregular total labellings of generalized Petersen graphs”, Theory of computing systems, Vol. 50, pp. 537-544, 2012.
M. Imran, A. Aslam, S. Zafar and W. Nazeer, “Further results on edge irregularity strength of graphs”, Indonesian Journal of Combinatorics, Vol. 1, No. 2, pp. 82-91, 2017.
J. Ivanco and S. Jendrol, “Total edge irregularity strength of trees”, Discussiones mathematicae graph theory, Vol. 26, No. 3, pp. 449-456, 2006.
S. Jendrol, J. Miskuf, and R. Sotak, “Total edge irregularity strength of complete graphs and complete bipartite graphs”, Discrete Mathematics, Vol. 310, No. 3, pp. 400-407, Feb. 2010.
M. Kalkowski, M. Karonski and F. Pfender, “A new upper bound for
the irregularity strength of graphs”, SIAM journal on discrete mathematics, Vol. 25, No. 3, pp. 1319-1321, 2011.
P. Majerski and J. Przybylo, “On the Irregularity Strength of Dense Graphs”, SIAM Journal on Discrete Mathematics, Vol. 28, No. 1, pp. 197-205, 2014.
P. Majerski and J. Przybylo, “Total Vertex Irregularity Strength of Dense Graphs”, Journal of Graph Theory, Vol. 76, No. 1, pp. 34-41, 2013.
Nurdin, E. T. Baskoro, A. N. M. Salman and N. N. Gaos, “On the total vertex irregularity strength of trees”, Discrete Mathematics, Vol. 310, No. 21, pp. 3043-3048, 2010.
J. Przybylo, “Linear bound on the irregularity strength and the total vertex irregularity strength of graphs”, SIAM Journal on Discrete Mathematics, Vol. 23, No. 1, pp. 511-516, 2009.
M. K. Siddiqui, A. Ahmad, M. F. Nadeem and Y. Bashir, “Total edge irregularity strength of the disjoint union of sun graphs”, International Journal of Mathematics and Soft Computing, Vol. 3, No. 1, pp. 21-27, 2013.
F. Salama, “On total edge irregularity strength of polar grid graph”, Journal of Taibah University for Science, Vol. 13, No. 1, pp. 912-916, 2019.
I. Tarawneh, R. Hasni and A. Ahmad, “On the edge irregularity strength of corona product of cycle with isolated vertices”, AKCE International Journal of Graphs and Combinatorics, Vol. 13, No. 3, pp. 213-217, 2016.
I. Tarawneh et al., “On the edge irregularity strength for some classes of plane graphs”, AIMS Mathematics, Vol. 6, No. 3, pp. 2724-2731, 2021.
I. Tarawneh, R. Hasni and A. Ahmad, “On the edge irregularity strength of corona product of graphs with paths”, Appl. Math. ENotes, Vol. 16, pp. 80-87, 201
I. Tarawneh, R. Hasni and M. A. Asim, “On the edge irregularity strength of disjoint union of star graph and subdivision of star graph”, Ars Comb., Vol. 141, pp. 93-100, 2018.
I. Tarawneh, R. Hasni and A. Ahmad, “On the edge irregularity strength of grid graphs”, AKCE International Journal of Graphs and Combinatorics, Vol. 17, No. 1, pp. 414-418, 2020.
X. Zhang, M. Cancan, M. F. Nadeem and M. Imran, “Edge irregularity strength of certain families of comb graph”, Proyecciones (Antofagasta), Vol. 39, No. 4, pp. 787-797, 2020.
Published
How to Cite
Issue
Section
Copyright (c) 2024 Muhammad Imran, Murat Cancan, Muhammad Faisal Nadeem, Yasir Ali
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
