{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:34:58Z","timestamp":1760240098389,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T00:00:00Z","timestamp":1552867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Let c be a proper k-coloring of a graph G. Let     \u03c0 = {  R 1  ,  R 2  , \u2026 ,  R k  }     be the partition of     V ( G )     induced by c, where     R i     is the partition class receiving color i. The color code      c \u03c0   ( v )      of a vertex v of G is the ordered k-tuple     ( d  ( v ,  R 1  )  , d  ( v ,  R 2  )  , \u2026 ,        d ( v ,  R k  ) ) ,     where     d ( v ,  R i  )     is the minimum distance from v to each other vertex     u \u2208  R i      for     1 \u2264 i \u2264 k    . If all vertices of G have distinct color codes, then c is called a locating k-coloring of G. The locating-chromatic number of G, denoted by      \u03c7 L   ( G )     , is the smallest k such that G admits a locating coloring with k colors. In this paper, we give a characterization of the locating chromatic number of powers of paths. In addition, we find sharp upper and lower bounds for the locating chromatic number of powers of cycles.<\/jats:p>","DOI":"10.3390\/sym11030389","type":"journal-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:18:53Z","timestamp":1552911533000},"page":"389","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Locating Chromatic Number of Powers of Paths and Cycles"],"prefix":"10.3390","volume":"11","author":[{"given":"Manal","family":"Ghanem","sequence":"first","affiliation":[{"name":"Department of Mathematics, School of Science, The University of Jordan, Amman 11942, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7854-9237","authenticated-orcid":false,"given":"Hasan","family":"Al-Ezeh","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Science, The University of Jordan, Amman 11942, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ala\u2019a","family":"Dabbour","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Science, The University of Jordan, Amman 11942, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,18]]},"reference":[{"key":"ref_1","unstructured":"Chartrand, G., and Oellermann, O.R. (1998). Applied and Algorithmic Graph Theory, McGraw-Hill, Inc."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.21042\/AMNS.2017.1.00016","article-title":"Odd mean labeling for two star graph","volume":"2","author":"Sudhakar","year":"2017","journal-title":"Appl. Math. Nonlinear Sci."},{"key":"ref_3","first-page":"89","article-title":"The locating chromatic number of a graph","volume":"36","author":"Chartrand","year":"2002","journal-title":"Bull. Inst. Combin. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(02)00829-4","article-title":"Graphs of order n with locating-chromatic number n \u2212 1","volume":"269","author":"Chartrand","year":"2003","journal-title":"Discr. Math."},{"key":"ref_5","first-page":"1","article-title":"Locating-chromatic number of amalgamation of stars","volume":"43A","author":"Asmiati","year":"2011","journal-title":"ITB J. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.procs.2015.12.081","article-title":"On locating-chromatic number for graphs with dominant vertices","volume":"74","author":"Welyyanti","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jctb.1998.1831","article-title":"Pattern periodic coloring of distance graphs","volume":"B73","author":"Zhu","year":"1998","journal-title":"J. Comb. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1006\/jctb.2001.2093","article-title":"Distance Graphs with Finite Chromatic Number","volume":"B85","author":"Ruzsa","year":"2002","journal-title":"J. Comb. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: A survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","article-title":"Choosability of powers of circuits","volume":"19","author":"Prowse","year":"2003","journal-title":"Graphs Combin."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/3\/389\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:38:34Z","timestamp":1760186314000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/3\/389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,18]]},"references-count":11,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["sym11030389"],"URL":"https:\/\/doi.org\/10.3390\/sym11030389","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,3,18]]}}}