Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Kubik KUBIK: Jurnal Publikasi Ilmiah Matematika
Junjungan Dwipa Sakti Simanjuntak
Universitas Tanjungpura
Computer Science & IT Economics, Econometrics & Finance Education Mathematics

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

Found 2 Documents
Search

 1 
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 Fransiskus Fran Yudhi