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...

Full description

Saved in:
Bibliographic Details
Main Authors: Redha Sakri, Boualem Slimi
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!
_version_ 1849689456410361856
author Redha Sakri
Boualem Slimi
author_facet Redha Sakri
Boualem Slimi
author_sort Redha Sakri
collection DOAJ
description 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 number of generalized Petersen graphs P(n,2) when n even and n≥14.
format Article
id doaj-art-ea20ece8cd2c414382b184eb80c3aeac
institution DOAJ
issn 2666-657X
language English
publishDate 2025-06-01
publisher Elsevier
record_format Article
series Examples and Counterexamples
spelling doaj-art-ea20ece8cd2c414382b184eb80c3aeac2025-08-20T03:21:38ZengElsevierExamples and Counterexamples2666-657X2025-06-01710018310.1016/j.exco.2025.100183The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)Redha Sakri0Boualem Slimi1National High School for Hydraulic (ENSH), BP 31 Blida, Algeria; Corresponding author.Department of Mathematics, Faculty of Sciences, Blida1 University, AlgeriaThe 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 number of generalized Petersen graphs P(n,2) when n even and n≥14.http://www.sciencedirect.com/science/article/pii/S2666657X25000102Generalized Petersen graphsColor codeLocating chromatic numberLocating coloring
spellingShingle Redha Sakri
Boualem Slimi
The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
Examples and Counterexamples
Generalized Petersen graphs
Color code
Locating chromatic number
Locating coloring
title The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
title_full The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
title_fullStr The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
title_full_unstemmed The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
title_short The bound on the locating-chromatic number for a generalized Petersen graphs P(N,2)
title_sort bound on the locating chromatic number for a generalized petersen graphs p n 2
topic Generalized Petersen graphs
Color code
Locating chromatic number
Locating coloring
url http://www.sciencedirect.com/science/article/pii/S2666657X25000102
work_keys_str_mv AT redhasakri theboundonthelocatingchromaticnumberforageneralizedpetersengraphspn2
AT boualemslimi theboundonthelocatingchromaticnumberforageneralizedpetersengraphspn2
AT redhasakri boundonthelocatingchromaticnumberforageneralizedpetersengraphspn2
AT boualemslimi boundonthelocatingchromaticnumberforageneralizedpetersengraphspn2