On The Edge Irregularity Strength of Firecracker Graphs F2,m

Authors

  • Rismawati Ramdani Scopus ID: 55851423500, Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung, Indonesia
  • Desi Laswati Suwandi

DOI:

https://doi.org/10.15575/kubik.v7i1.18430

Keywords:

edge irregular labeling, firecracker, the edge irregularity strength

Abstract

Let  be a graph and k be a positive integer. A vertex k-labeling  is called an edge irregular labeling if there are no two edges with the same weight, where the weight of an edge uv is . The edge irregularity strength of G, denoted by es(G), is the minimum k such that  has an edge irregular k-labeling. This labeling was introduced by Ahmad, Al-Mushayt, and Bacˇa in 2014.  An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each. In this paper, we determine the edge irregularity strength of fireworks graphs F2,m.

References

M. BaÄa, M. Miller, and J. Ryan, “On irregular total labellings,†Discrete Math., vol. 307, no. 11–12, pp. 1378–1388, 2007.

G. Chartrand, P. Erdös, and O. R. Oellermann, “How to define an irregular graph,†Coll. Math. J., vol. 19, no. 1, pp. 36–42, 1988.

A. Ahmad, O. B. S. Al-Mushayt, and M. BaÄa, “On edge irregularity strength of graphs,†Appl. Math. Comput., vol. 243, pp. 607–610, 2014.

M. Imran, A. Aslam, S. Zafar, and W. Nazeer, “Further results on edge irregularity strength of graphs,†Indones. J. Comb., vol. 1, no. 2, pp. 82–91, 2017.

I. Tarawneh, R. Hasni, and A. Ahmad, “On the edge irregularity strength of corona product of cycle with isolated vertices,†AKCE Int. J. Graphs Comb., vol. 13, no. 3, pp. 213–217, 2016.

A. Ahmad, M. A. Asim, B. Assiri, and A. SemaniÄová-FeňovÄíková, “Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs,†Fundam. Informaticae, vol. 174, no. 1, pp. 1–13, 2020.

A. Ahmada, A. Guptaa, and R. Simanjuntakb, “Computing the edge irregularity strengths of chain graphs and the join of two graphs,†Electron. J. Graph Theory Appl., vol. 6, no. 1, pp. 201–207, 2018.

M. A. Asim, A. Ahmad, and R. Hasni, “Edge irregular k-labeling for several classes of trees,†Util. Math, vol. 111, pp. 75–83, 2019.

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, A. Ahmad, and M. A. Asim, “On the edge irregularity strength for some classes of plane graphs,†AIMS Math, vol. 6, pp. 2724–2731, 2021.

Downloads

Published

2022-09-30

How to Cite

Ramdani, R., & Suwandi, D. L. (2022). On The Edge Irregularity Strength of Firecracker Graphs F2,m. KUBIK: Jurnal Publikasi Ilmiah Matematika, 7(1), 31–37. https://doi.org/10.15575/kubik.v7i1.18430

Issue

Vol. 7 No. 1 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika

Section

Articles

Citation Check

License

Authors who publish in KUBIK: Jurnal Publikasi Ilmiah Matematika agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

 

Â