Claim Missing Document
Check
Articles

Packing Chromatic Number of Graph Families Constructed from the Fan Graph Raventino Raventino; Fransiskus Fran; Yudhi Yudhi
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 11, No 2 (2026): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v11i2.44807

Abstract

Packing coloring is particularly sensitive to graph distances, since even a simple structural modification may change whether a color can be reused. This paper investigates the packing chromatic number of several constructions derived from the fan graph, namely the subdivision fan S(Fn), the umbrella graph Ur,s, two barbell-type fan constructions, and the generalized q-fan chain CFm(q) formed by sequentially joining the centers of q copies of Fm. The known packing chromatic number of the ordinary fan is used only as a reference result. By combining explicit packing colorings with lower bound arguments based on independence numbers, graph diameters, color class capacities, and cross-component distances, we prove that (S(Fn)) = 4 for n 2 and determine the exact packing chromatic numbers of the umbrella and both barbell-type constructions. For CFm(q), we establish general lower and upper bounds for all m, q 2 by showing that a color 2 can occur on at most q/( 1) vertices. Moreover, when m 2q 2, the bounds coincide and yield (CFm(q)) = q(m/2 + 2) t=1q1q/t. These results show that the packing chromatic behavior of fan-derived graphs is governed by the distance structure created by the underlying graph operation, particularly the extent to which low colors can be reused across different fan copies.
Pelabelan Rata-Rata Geometris Graf Ular \mathbit{m}\mathbit{C}_\mathbit{n} Junjungan Dwipa Sakti Simanjuntak; Fransiskus Fran; Yudhi Yudhi
KUBIK Vol 11 No 1 (2026): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Department of Mathematics, Faculty of Science and Technology, UIN Sunan Gunung Djati Bandung

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

Abstract

Labeling on a graph is a mapping that assigns each element of the graph, namely a set of edges or a set of vertices to positive integer numbers, called labels. One type of graph labeling is geometric mean labeling, a variation of arithmetic mean labeling. The geometric mean labeling of a graph G = (V(G), E(G)) with vertices and edges is the injective function h from V(G) to {1,2,3, ..., q + 1} which induces a bijective function h* from E(G) to {1,2,3, ..., q} such that for each edge e = uv є E(G), h* (uv) = L√h(u)h(v)˩. A geometric mean graph is a graph that can be labeled with a geometric mean labeling. In this article, we discussed a geometric mean labeling on a snake graph mCn with n = 5,6,7,8 and m ≥ 1. The construction process of geometric mean labeling on the snake graph mCn with n = 5,6,7,8 and m ≥ 1 is done by labeling the vertices on the graph, which induces edge labels that meet the definition of geometric mean labeling. The results from the construction of geometric mean labeling patterns on the snake graph mCn with n = 5,6,7,8 and m ≥ 1 are geometric mean graphs.
Pelabelan Rata-Rata Geometris Graf Ular \mathbit{m}\mathbit{C}_\mathbit{n} Junjungan Dwipa Sakti Simanjuntak; Fransiskus Fran; Yudhi Yudhi
KUBIK Vol 11 No 1 (2026): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Department of Mathematics, Faculty of Science and Technology, UIN Sunan Gunung Djati Bandung

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

Abstract

Labeling on a graph is a mapping that assigns each element of the graph, namely a set of edges or a set of vertices to positive integer numbers, called labels. One type of graph labeling is geometric mean labeling, a variation of arithmetic mean labeling. The geometric mean labeling of a graph G = (V(G), E(G)) with vertices and edges is the injective function h from V(G) to {1,2,3, ..., q + 1} which induces a bijective function h* from E(G) to {1,2,3, ..., q} such that for each edge e = uv є E(G), h* (uv) = L√h(u)h(v)˩. A geometric mean graph is a graph that can be labeled with a geometric mean labeling. In this article, we discussed a geometric mean labeling on a snake graph mCn with n = 5,6,7,8 and m ≥ 1. The construction process of geometric mean labeling on the snake graph mCn with n = 5,6,7,8 and m ≥ 1 is done by labeling the vertices on the graph, which induces edge labels that meet the definition of geometric mean labeling. The results from the construction of geometric mean labeling patterns on the snake graph mCn with n = 5,6,7,8 and m ≥ 1 are geometric mean graphs.
Co-Authors Aan Febriansyah Al Azizi, Fudhail Azzam Thoriqi Aljona, Sarah Amalia Wigati Aminuyati Ammar, Farid Ananda Sapitri, Anjelalica Andi Hairil Alimuddin Andri Royani Anggelina, Florensi Silva Anggraeni, Rosiana Angraini, Wanda Apriliandi Apriliandi Arin Yerliansyah Arya Pratama, Putra Handika Asri Rahmawati Azura, Tina Bayu Prihandono BENI, YAKOBUS Danang Try Purnomo Debataraja, Naomi Nessyana Dedek Noviyani Desi Ayu Wulandari Dessy Natalia Dhea Prameswari Dina Dina, Dina Egi Riansyah Eko Sulistyo Elvi Rusmiyanto P.W. Endah Sayekti Evi Novian Evi Noviani Fadilatul Amalia FAJRIN NURSETYA DESI Fansiskus Fran Fauzan, M Nur Febriyanto, Ferdy Feby Fitria Ramadhita Feriliani Maria Nani Firman Saputra Fitriani Fitriani Fran, Fransiskus Frananta Maha Fransiskus Fran Fransiskus Fran Hasanuddin Hasanuddin Helmi Helmi Helmi Helmi Helmi Hendra Perdana Humaira Ichlashi Amaliah Ilham, Muhamad Ilham Irfant Bayu Pratama Irma Nirmala Irvandi, Firzakalpa Syafiq Iskandar, Rais Junjungan Dwipa Sakti Simanjuntak Khairun Nisa Khariyyah, Lina Laksono Trisnantoro Lili Oktaviana Liliana, Tiara Limanto, Vincent Lita Novianti Lovi Dwi Purnamasari Luluk Hendriyana Mahmul Mahmul Maisurah Maisurah Mareta, Nadia Mariatul Kiftiah Martha, Shantika Maulydiana Septiani Mawarni, Selkia Meiliana Meiliana Meliana Pasaribu Miftahul Hasanah, Miftahul Minong, Stepanus Mochammad Imron Awalludin Mudinillah, Adam Muhammad Adiyan Septianda Muhardi Naomi Nessyana Debataraja Neva Satyahadewi Nilamsari Kusumastuti Nopiani Nopiani Novitasari Novitasari Nurfitri Imroah Nurfitriana Nurfitriana Nurtaniyahya, Ilham Nurul Fadhilah NUR’AINUL MIFTAHUL HUDA Ocsirendi Okta Rina, Tiara Onelia Rochmah Paranditus Paranditus Paranditus, Paranditus Pratama, Anjeryan Sapta Puji Ardiningsih Puteri Islamega Taufani Rabitah Al-Alawiyah Rama Valivi ratih ratih Raventino Raventino Rayhannisa, Rayhannisa Renisa Auditaputri Reny Puspita Sari Rian Prasetio Riki Afriansyah Risko, Risko Sahrial Sakti Simanjuntak, Junjungan Dwipa Sandi, Sabinus Saputra, Irpan Selah Siti Nur Amanah Steven Suhardi Sukal Minsas Tantri, Eliana Tesah Aldi Parani Tri Desrehan, Sagit Tripina, Maria Try Purnomo , Danang Uray Agustian Utari, Dina Wahyu Fahrizal Windarti, Ayu Yanitami, Alvi Yuli Rahayu Yuliardi Kurniawan Yundari, Yundari Yundari, Yundari Yuni Wulandari Yusnanda Yusnanda Zanu Saputra Zettira Septiani