Article Per Year (5 Year)
p-Index From 2019 - 2024
0.408
P-Index
This Author published in this journals
All Journal Kubik KUBIK: Jurnal Publikasi Ilmiah Matematika
Desi Laswati Suwandi
Unknown Affiliation
Computer Science & IT Economics, Econometrics & Finance Education Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
On The Edge Irregularity Strength of Firecracker Graphs F2,m Rismawati Ramdani; Desi Laswati Suwandi
KUBIK Vol 7, No 1 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i1.18430

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.
On The Edge Irregularity Strength of Firecracker Graphs F2,m Rismawati Ramdani; Desi Laswati Suwandi
KUBIK Vol 7, No 1 (2022): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v7i1.18430

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.
Co-Authors Rismawati Ramdani