Upper Bounds of the Locating Chromatic Numbers of Shadow Cycle Graphs

被引：0

作者：

Asmiati ^{[1
]}

Okzarima, Wenty ^{[1
]}

Notiragayu ^{[1
]}

La Zakaria ^{[1
]}

机构：

[1] Univ Lampung, Fac Math & Nat Sci, Dept Math, Bandar Lampung, Indonesia

来源：

INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE | 2024年 / 19卷 / 01期

关键词：

Color classes; locating chromatic number; shadow cycle graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：239 / 248

页数：10