We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Upper Bounds of the Locating Chromatic Numbers of Shadow Cycle Graphs.
- Authors
Asmiati; Okzarima, Wenty; Notiragayu; Zakaria, La
- Abstract
If G is a connected finite simple graph with its vertices properly colored with k colors appearing, then with respect to an ordering of the colors, to each vertex v a k-tuple can be assigned whose entries give the distances in G from v to the different color sets. The locating chromatic number (lcn) of G is the smallest k for which a proper vertex coloring of G with k colors appearing exists such that the corresponding k-tuples are distinct. In this paper we obtain by construction upper bounds on the lcns of shadow cycle graphs.
- Subjects
GRAPH coloring; COLORS; COLOR
- Publication
International Journal of Mathematics & Computer Science, 2024, Vol 19, Issue 1, p239
- ISSN
1814-0424
- Publication type
Article