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

DOI10.5614/ejgta.2022.10.2.18zbMath1499.05239OpenAlexW4308003493MaRDI QIDQ5054056

Faisal Susanto, Selvy Musdalifah, I. Wayan Sudarsana

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.2.18

zbMATH Keywords

pathcomplete multipartite graphlocating chromatic numberlocating coloring\(m\)-shadow of graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The locating chromatic number of the join of graphs
• On the locating chromatic number of Kneser graphs
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• On the locating chromatic number of certain barbell graphs
• Upper bounds on the locating chromatic number of trees
• Improved algorithm for the locating-chromatic number of trees
• Calculating an upper bound of the locating-chromatic number of trees
• On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles
• Locating chromatic number of powers of paths and cycles
• On the Locating Chromatic Number of the Cartesian Product of Graphs
• On locating chromatic number of Möbius ladder graphs
• On the Locating Chromatic Number of Trees
• Characterizing all trees with locating-chromatic number 3

This page was built for publication: The locating chromatic number for m-shadow of a connected graph