The Locating Chromatic Number of Book Graph

Nur Inayah, Wisnu Aribowo, Maiyudi Mariska Windra Yahya and Elena Guardo

Journal of Mathematics, 2021, vol. 2021, 1-3

Abstract: Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Πbe a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each partition to the vertex v. If distinct vertices have distinct color code, then c is called a locating k-coloring of G. The locating chromatic number of G is the smallest k such that G has a locating k-coloring. In this paper, we determine the locating chromatic number of book graph.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/3716361.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/3716361.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3716361

DOI: 10.1155/2021/3716361

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().