On the Locating Chromatic Number of Barbell Shadow Path Graph

Asmiati, A.; Damayanti, Maharani; Yulianti, Lyra

doi:10.19184/ijc.2021.5.2.4

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later in the same year, Irawan et al [21] obtained the lcn of the origami barbell graph. Furthermore, Asmiati et al [22] in 2021 succeeded in determining the lcn of the path shadowgraph and its barbell.…”

Section: Introductionmentioning

confidence: 99%

The Locating Chromatic Number for Certain Operation of Origami Graphs

Asmiati¹,

Irawan²,

Nuryaman³

et al. 2023

View full text Add to dashboard Cite

The locating chromatic number introduced by Chartrand et al. in 2002 is the marriage of the partition dimension and graph coloring. The locating chromatic number depends on the minimum number of colors used in the locating coloring and the different color codes in vertices on the graph. There is no algorithm or theorem to determine the locating chromatic number of any graph carried out for each graph class or the resulting graph operation. This research is the development of scientific theory with a focus of the study on developing new ideas to determine the extent to which the locating chromatic number of a graph increases when applied to other operations. The locating chromatic number of the origami graph was obtained. The next exciting thing to know is locating chromatic number for certain operation of origami graphs. This paper discusses locating chromatic number for specific operation of origami graphs. The method used in this study is to determine the upper and lower bound of the locating chromatic number for certain operation of origami graphs. The result obtained is an increase of one color in the locating chromatic number of origami graphs.

show abstract

Section: Introductionmentioning

confidence: 99%