2018
DOI: 10.1016/j.endm.2018.06.023
|View full text |Cite
|
Sign up to set email alerts
|

Neighbor-locating coloring: graph operations and extremal cardinalities

Abstract: A k−coloring of a graph G = (V, E) is a k-partition Π = {S 1 ,. .. , S k } of V into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices u, v belonging to the same color S i , the set of colors of the neighborhood of u is different from the set of colors of the neighborhood of v. The neighbor-locating chromatic number, χ N L (G), is the minimum cardinality of a neighbor-locating coloring of G. In this paper, we examine the neighbor-locating chromatic number f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Taking cues from the concepts of location [15], neighbor-location [16] and locally identifying colorings [10], recently, two variants of graph coloring were introduced, namely, locating coloring [8] and neighbor-locating coloring [2,4]. While the former concept has been well-studied since 2002 [4,5,6,7,8,9,13,14,17,18,19]), our focus of study is the latter, which was introduced in 2014 in [4] under the name of adjacency locating coloring, renamed in 2020 in [2] and studied in a few papers since then [1,3,11,12].…”
Section: Introductionmentioning
confidence: 99%
“…Taking cues from the concepts of location [15], neighbor-location [16] and locally identifying colorings [10], recently, two variants of graph coloring were introduced, namely, locating coloring [8] and neighbor-locating coloring [2,4]. While the former concept has been well-studied since 2002 [4,5,6,7,8,9,13,14,17,18,19]), our focus of study is the latter, which was introduced in 2014 in [4] under the name of adjacency locating coloring, renamed in 2020 in [2] and studied in a few papers since then [1,3,11,12].…”
Section: Introductionmentioning
confidence: 99%
“…Taking cues from the above research topics, recently, two variants of graph coloring were introduced, namely, locating coloring [9] and neighbor-locating coloring [2,5]. While the former concept has been well-studied since 2002 [5-10, 19, 20, 23-25]), our focus of study is the latter, which was introduced in 2014 in [5] under the name of adjacency locating coloring, renamed in 2020 in [2] and studied in a few papers since then [1,3,14,17].…”
Section: Introductionmentioning
confidence: 99%