Open AccessOn Locating Chromatic Number of Disconnected Graph with Path, Cycle, Stars or Double Stars as its Components
Author(s) -
Des Welyyanti,
Suci Rahma Putri,
Mohammed El Azhari,
Riri Lestari
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1742/1/012020
Subject(s) - stars , chromatic scale , combinatorics , graph , mathematics , path (computing) , discrete mathematics , computer science , physics , astrophysics , computer network
Concept of the locating-chromatic number of graphs is introduced firstly by Chartrand et al. in 2002. In this concept only limited for connected graphs. In 2004, Welyyanti et al. generalized the concept and notion of the locating-chromatic number of a graph such that it can be applied for a disconnected graph. In this paper, we determine the locating-chromatic number for disconnected graphs with path, stars, cycle, or double stars as it's components.