Rainbow Vertex Antimagic Coloring for Degree Splitting of Cycle, Star and Path Graph

View at publisher Summarise with VIRAT
Authors: P. Reka, R. Abarnasri, S. P. Soundariya
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Rainbow Vertex Coloring is characterized by the condition that each set of vertices is connected by a trail containing distinct Colors assigned to the interior vertices, and the graph G is categorized by its Rainbow vertex connection denoted as rvc(G). A Rainbow vertex antimagic Coloring can be done when edges are assigned distinct labels with the integers 1, 2 … |E (G) and determines different weights for every interior vertex of V(G) between u to v throughout the trialand the vertex weight for u in V(G) is defined as sum of the edge incident with vertex u in G. The G is considered as a Rainbow vertex antimagic coloring if a Rainbow trial exists between every set of vertices. The Rainbow vertex antimagic connection is written as rvac(G), which signifies the smallest number required to achieve coloring. This work investigates Rainbow Vertex Coloring and Rainbow Vertex Antimagic Coloring in Cycle, Path, and Star graphs with respect to degree splitting.

Fields of Study & Subjects

Graph Labeling and Dimension Problems Advanced Graph Theory Research Smarandache Functions and Recreational Number Theory

Publication details

Journal / source
CRC Press eBooks
Pages
246–250
Publication date
26 March 2026
Language
EN
Document type
Book chapter