Claim Missing Document
Check
Articles

Found 32 Documents
Search

L(3,1)-Labeling of Double-Quadrilateral Windmill And Flower Graphs Hafif Komarullah; Siti Zulfa Rosyidah; Rizqy Amalia Nurfadila; Mifdati Afifah
Jurnal Matematika, Statistika dan Komputasi Vol. 23 No. 1 (2026): September 2026
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/n3zjqz22

Abstract

The L(3,1)-labeling of a graph is a distance-constrained labeling in which adjacent vertices receive labels differing by at least 3, while vertices at distance two receive labels differing by at least 1. The minimum span among all such labelings, denoted by λ_3,1 (G), is called the L(3,1)-labeling number of G. In this paper, we determine the exact L(3,1)-labeling numbers of double-quadrilateral windmill graphs and double-quadrilateral flower graphs. By constructing feasible labelings and establishing sharp lower bounds, we prove that λ_3,1 (DQ_k)=3k+2 and λ_3,1 (FDQ_k)=2k+3 for every integer k≥2. These results provide the first L(3,1)-labeling characterization of these graph families and contribute to the study of distance-constrained graph labeling on graphs composed of interconnected quadrilateral cycles.
On the Minimum Coprime Number of Some Graphs Hafif Komarullah; Kristiana Wijaya; Noor Hidayat; Vira Hari Krisnawati
Science and Technology Indonesia Vol. 11 No. 4 (2026): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2026.11.4.1300-1310

Abstract

Let G be a finite simple graph. A coprime labeling of G is an injective assignment of positive integers to the vertices such that adjacent vertices receive relatively prime labels. The minimum coprime number of G, denoted by pr(G), is the smallest integer k for which G admits a coprime labeling using labels from {1, 2, ..., k}. In this paper, we determine the exact minimum coprime number of several graph families, namely the disjoint union of cycle graphs, the disjoint union of complete graphs, and dumbbell graphs. For the graph mCn with n odd, explicit coprime labeling constructions are provided and exact values of pr(mCn) are obtained for several infinite families. We also establish exact minimum coprime numbers for mKn and characterize prime and coprime labelings of dumbbell graphs according to the parity of their parameters. Furthermore, constructive labeling functions are presented for all considered graph classes. These results extend previous studies on minimum coprime labeling for graph operations and disconnected graph families.