The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
The concept of the locating-chromatic number for graphs was introduced by Chartrand et al. (2002). Recently, Sakri and Abbas (2024), presented the locating-chromatic number of generalized Petersen graphs P(n,k) when n≤12. In this paper, We determine a lower and upper bound for the locating chromatic...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-06-01
|
| Series: | Examples and Counterexamples |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X25000102 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|