Open AccessThe Locating Chromatic Number of some Modified Path with Cycle having Locating Number Four
Author(s) -
Maharani Damayanti,
Asmiati Asmiati,
Fitriani Fitriani,
Muslim Ansori,
Atika Faradilla
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/1751/1/012008
Subject(s) - chromatic scale , combinatorics , mathematics , graph , windmill graph , friendship graph , critical graph , partition (number theory) , wheel graph , discrete mathematics , graph power , line graph
The locating-chromatic number was introduced by Chartrand in 2002. The locating-chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph G is defined as the cardinality of minimum color classes. In this paper, we discuss about the locating chromatic number of three types modified path with cycle having locating chromatic number four.