Locating chromatic number of powers of paths and cycles

DOI10.3390/sym11030389zbMath1423.05068OpenAlexW2921725598WikidataQ128215810 ScholiaQ128215810MaRDI QIDQ2335071

Ala'a Dabbour, Manal Ghanem, Hassan Al-Ezeh

Publication date: 13 November 2019

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym11030389

zbMATH Keywords

locating chromatic numberpowers of cyclespowers of paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

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

Cites Work

• Pattern periodic coloring of distance graphs
• Choosability of powers of circuits
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• Distance graphs with finite chromatic number
• Circulants and their connectivities
• Odd mean labeling for two star graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating chromatic number of powers of paths and cycles