Work

On Rainbow Antimagic Coloring of Some Classes of Graphs

Year: 2023
Type: book-chapter
Abstract: This study aims to develop rainbow antimagic coloring.A graph G is said to be a rainbow antimagic coloring if there is a bijectionto 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 Fp, dragon graph Dgp, bow graph Bp,q, and wheel graph Wp.In this paper, we complete previous research of rainbow antimagic connection number of vertex amalgamation product of fan graph until reaching the lower bound.
Institution: Universitas Jember
Language: English
Open Access status: hybrid
OpenAlex ID: W4367019503
FWCI: 12.08
Cites: 15
Cited by: 9
Related to: 10