On locating chromatic number of Möbius ladder graphs

DOI10.22199/issn.0717-6279-4170zbMath1478.05043OpenAlexW3157297779MaRDI QIDQ5027742

Redha Sakri, Moncef Abbas

Publication date: 7 February 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-4170

zbMATH Keywords

locating coloringcolor codelocating-chromatic numberMöbius-ladders

Mathematics Subject Classification ID

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

Related Items (1)

The locating chromatic number for m-shadow of a connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• Counting structures in the Möbius ladder
• Conditional resolvability in graphs: a survey
• Recursive families of graphs
• On the Locating Chromatic Number of the Cartesian Product of Graphs
• Characterizing all graphs containing cycles with locating-chromatic number 3
• Characterizing all trees with locating-chromatic number 3
• On the Möbius Ladders

This page was built for publication: On locating chromatic number of Möbius ladder graphs