The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by χL(G). This article proposes a procedure for obtaining a locating-chromatic number for an origami graph and its subdivision (one vertex on an outer edge) through two theorems with proofs.
The locating-chromatic number of a graph was combined two graph concept, coloring vertices and partition dimension of a graph. In this paper, we discuss about locating-chromatic number of a subdivision firecracker graphs.
The locating-chromatic number of a graph combined two graph concept, coloring vertices and partition dimension of a graph. The locating-chromatic number, denoted by χL
(G), is the smallest k such that G has a locating k-coloring. In this paper, we discuss the locating-chromatic number for certain barbell Origami graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.