A Minimum Coprime Number for Amalgamation of Wheel
Authors
Hafif Komarullah1, *, Slamin2, Kristiana Wijaya1
1Graph, Combinatorics, and Algebra Research Group, Department of Mathematics, FMIPA, Universitas Jember
2Study Program of Informatics, Universitas Jember, Indonesia
*Corresponding author. Email: hafififa4@gmail.com
Corresponding Author
Hafif Komarullah
Available Online 8 February 2022.
- DOI
- 10.2991/acsr.k.220202.012How to use a DOI?
- Keywords
- Minimum coprime labeling; Minimum coprime number; Amalgamation of wheel
- Abstract
Let G be a simple graph of order n. A coprime labeling of a graph G is a vertex labeling of G with distinct positive integers from the set {1, 2, …, k} for some k ≥ n such that any adjacent labels are relatively prime. The minimum value of k for which G has a coprime labelling, denoted as 𝔭𝔯(G), is called the minimum coprime number of G. A coprime labeling of G with the largest label being 𝔭𝔯(G) is said a minimum coprime labeling of G. In this paper, we give the exact value of the minimum coprime number for amalgamations of wheel Wn when n is odd positive integer.
- Copyright
- © 2022 The Authors. Published by Atlantis Press International B.V.
- Open Access
- This is an open access article under the CC BY-NC license.
Cite this article
TY - CONF AU - Hafif Komarullah AU - Slamin AU - Kristiana Wijaya PY - 2022 DA - 2022/02/08 TI - A Minimum Coprime Number for Amalgamation of Wheel BT - Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021) PB - Atlantis Press SP - 53 EP - 57 SN - 2352-538X UR - https://doi.org/10.2991/acsr.k.220202.012 DO - 10.2991/acsr.k.220202.012 ID - Komarullah2022 ER -