Analysis of Neutrosophic Dominating Path-Coloring and Multivalued Star Chromatic Numbers in Neutrosophic Graphs

Abstract

Graph products are a mathematical concept used to derive information about large graphs based on the properties and characteristics of smaller, simpler graphs. By understanding the smaller graphs and how they combine, insights about the larger, more complex graphs can be obtained efficiently. In this research, a new method for analyzing the neutrosophic dominating path-coloring number and the dominant path-coloring number in neutrosophic graphs is presented. Additionally, it computes their multivalued star chromatic number and suggests a novel technique for multivalued star coloring on the corona product of two neutrosophic graphs. Within neutrosophic graphs, the neutrosophic dominant path-coloring number is a measure of connectedness.