On Locating Chromatic Number of H = Pm ∪ Wn
A. Anti, Des Welyyanti, Mohammed El Azhari
Abstract
Open-access reader
A. Anti, Des Welyyanti, Mohammed El Azhari
Abstract
Open-access reader
Abstract A married of vertex coloring partition and dimension of graph, became a definition of locating chromatic number of graph. That draught only can apply for connected graph. Because that, Welyyanti et al. expand concept of the locating chromatic number for disconnected graph. For this paper, the locating-chromatic number of disconnected graph contains one path and wheel graph as its components, is determined.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract A married of vertex coloring partition and dimension of graph, became a definition of locating chromatic number of graph. That draught only can apply for connected graph. Because that, Welyyanti et al. expand concept of the locating chromatic number for disconnected graph. For this paper, the locating-chromatic number of disconnected graph contains one path and wheel graph as its components, is determined.
Key concepts: Windmill graph, Combinatorics, Chromatic scale, Friendship graph, Wheel graph, Graph, Mathematics, Butterfly graph