On Rainbow Antimagic Coloring of Some Classes of Graphs
- 10.2991/978-94-6463-138-8_8How to use a DOI?
- Edge coloring; rainbow antimagic coloring; vertex amalgamation
This study aims to develop rainbow antimagic coloring. A graph G is said to be a rainbow antimagic coloring if there is a bijection function and the associated weight of an edge under f is If there is for every two edges in E(P), a path P in a vertex-labeled graph G is said to be a rainbow path. The purpose of this paper is to study the rainbow antimagic coloring and determine the smallest number of rainbow antimagic connection number, denoted by rac(G), where G is the vertex amalgamation of some graphs, namely fan graph , dragon graph , bow graph , and wheel graph . In this paper, we complete previous research of rainbow antimagic connection number of vertex amalgamation product of fan graph until reaching the lower bound.
- © 2023 The Author(s)
- Open Access
- Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
Cite this article
TY - CONF AU - Indah Lutfiyatul Mursyidah AU - Dafik AU - Arika Indah Kristiana AU - Ika Hesti Agustin AU - Ika Nur Maylisa AU - Ridho Alfarisi PY - 2023 DA - 2023/04/27 TI - On Rainbow Antimagic Coloring of Some Classes of Graphs BT - Proceedings of the 6th International Conference of Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022) PB - Atlantis Press SP - 73 EP - 93 SN - 2352-541X UR - https://doi.org/10.2991/978-94-6463-138-8_8 DO - 10.2991/978-94-6463-138-8_8 ID - Mursyidah2023 ER -