Pelabelan Rata-Rata Geometris Graf Ular mCn

Authors

  • Junjungan Dwipa Sakti Simanjuntak Universitas Tanjungpura, Indonesia
  • Fransiskus Fran Universitas Tanjungpura, Indonesia
  • Yudhi Yudhi Universitas Tanjungpura, Indonesia

DOI:

https://doi.org/10.15575/kubik.v11i1.38560

Keywords:

label, fungsi injektif, fungsi bijektif

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.

References

R. Munir, “Matematika Diskrit Edisi Ketiga,†Inform. Bdg. Bdg., 2010.

Dafik, “Structural properties and labeling of graphs,†2007.

K. P. CAHAYANI, R. H. Soelistyo, and S. ZAKI, “Pelabelan Cordial dan Graceful pada Arbitrary Supersubdivision Path dan Star,†2013.

R. Ponraj and S. Somasundaram, “Mean labeling of graphs obtained by identifying two graphs,†J. Discrete Math. Sci. Cryptogr., vol. 11, no. 2, pp. 239–252, 2008.

A. D. Baskar, S. Arockiaraj, and B. Rajendran, “Geometric mean labeling of graphs obtained from some graph operations,†Int. J. Math. Comb., vol. 1, p. 85, 2013.

J. A. Gallian, “A dynamic survey of graph labeling,†Electron. J. Comb., vol. 1, no. DynamicSurveys, p. DS6, 2018.

G. Chartrand and O. R. Oellermann, “Applied and algorithmic graph theory,†N. Y. McGraw-Hill, 1993.

Samuel Wibisono, Matematika Diskrit Edisi Kedua. Yogyakarta: Graha Ilmu, 2013.

Gary Chartrand and Linda Lesniak, Graph and Digraph. California: a Division of Wadsworth, Inc. Combinatoria 2, 1996.

R. Ardiansyah, “Bilangan kromatik graf hasil amalgamasi dua buah graf,†J. Sains Dan Seni POMITS, vol. 2, no. 1, pp. 1–5, 2013.

Downloads

Published

30-05-2026

How to Cite

Sakti Simanjuntak, J. D., Fran, F., & Yudhi, Y. (2026). Pelabelan Rata-Rata Geometris Graf Ular mCn. KUBIK: Jurnal Publikasi Ilmiah Matematika, 11(1), 22–38. https://doi.org/10.15575/kubik.v11i1.38560

Citation Check