1. r-Dynamic chromatic number of subdivision-edge neighborhood corona of certain graph families.
- Author
-
Kalaiselvi, K., Mohanapriya, N., and Aparna, V.
- Subjects
- *
SUBDIVISION surfaces (Geometry) , *BINARY stars , *GRAPH coloring , *RAMSEY numbers , *COMPLETE graphs , *GRAPH connectivity , *FAMILIES - Abstract
Let be a simple connected graph consisting of n vertices and m edges. In a proper l -coloring, an r -dynamic coloring of a graph is one in which each vertex's neighbors are provided at least min { r , d (k) } different colors. The r -dynamic chromatic number of graph , given as χ r () , is the minimal l such that the graph has r -dynamic l coloring of . In this study, we combine a few common graphs to provide the r -dynamic coloring of the subdivision-edge neighborhood corona of path graph P s and star graph K 1 , s . These graphs include path graph P q , cycle graph C q , complete graph K q , star graph K 1 , q , and double star graph K 1 , q , q . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF