Upper bounds of the locating chromatic numbers of shadow cycle graphs

MaRDI QIDQ6094833FDOQ6094833

Authors: Asmiati, Notiragayu, La Zakaria 

Publication date: 10 October 2023

Full work available at URL: http://ijmcs.future-in-tech.net/19.1/R-Asmiati.pdf

Recommendations

• The locating chromatic number for m-shadow of a connected graph
• scientific article; zbMATH DE number 1869706
• Characterizing all graphs containing cycles with locating-chromatic number 3
• Locating chromatic number of powers of paths and cycles
• On the locating chromatic number of the Cartesian product of graphs.

zbMATH Keywords

locating chromatic numbercolor classesshadow cycle graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Upper bounds of the locating chromatic numbers of shadow cycle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094833)