{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:04:25Z","timestamp":1760234665876,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by \u03c7L(G). This article proposes a procedure for obtaining a locating-chromatic number for an origami graph and its subdivision (one vertex on an outer edge) through two theorems with proofs.<\/jats:p>","DOI":"10.3390\/a14060167","type":"journal-article","created":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T11:07:02Z","timestamp":1622113622000},"page":"167","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Locating-Chromatic Number of Origami Graphs"],"prefix":"10.3390","volume":"14","author":[{"given":"Agus","family":"Irawan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Universitas Lampung, Bandar Lampung 35145, Indonesia"},{"name":"Information System, STMIK Pringsewu, Lampung 35373, Indonesia"}]},{"given":"Asmiati","family":"Asmiati","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Universitas Lampung, Bandar Lampung 35145, Indonesia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5566-4264","authenticated-orcid":false,"given":"La","family":"Zakaria","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Universitas Lampung, Bandar Lampung 35145, Indonesia"}]},{"given":"Kurnia","family":"Muludi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Universitas Lampung, Bandar Lampung 35145, Indonesia"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,27]]},"reference":[{"key":"ref_1","first-page":"55","article-title":"On the partition dimension of a graph","volume":"131","author":"Chartrand","year":"1998","journal-title":"Congr. Numer."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/PL00000127","article-title":"The Partition Dimension of a Graph","volume":"55","author":"Chartrand","year":"2000","journal-title":"Aequ. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs, Discrete Applied Mathematics","volume":"70","author":"Khuller","year":"1996","journal-title":"DIscrete Appl. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1155\/S0161171204311403","article-title":"Conditional resolvability: A survey","volume":"38","author":"Saenpholphat","year":"2004","journal-title":"Int. J. Math. Math. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10543409308835060","article-title":"Structure activity maps for visualizing the graph variables arising in drug design","volume":"3","author":"Johnson","year":"1993","journal-title":"J. Biopharm. Stat."},{"key":"ref_6","first-page":"47","article-title":"The theory and applications of resolvability in graphs: A survey","volume":"160","author":"Chartrand","year":"2003","journal-title":"Congr. Numer."},{"key":"ref_7","first-page":"89","article-title":"The locating-chromatic number of a graph","volume":"36","author":"Chartrand","year":"2002","journal-title":"Bull. Inst. Comb. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(02)00829-4","article-title":"Graf of order n with locating-chromatic number n \u2014 1","volume":"269","author":"Chartrand","year":"2003","journal-title":"Discret. Math."},{"key":"ref_9","first-page":"124","article-title":"The locating-chromatic number for corona product of graphs","volume":"1","author":"Baskoro","year":"2012","journal-title":"Shoutheast Asian J. Sci."},{"key":"ref_10","first-page":"89","article-title":"The Locating-Chromatic Number of Non-Homogeneous Amalgamation of Stars","volume":"93","author":"Asmiati","year":"2014","journal-title":"Far East J. Math. Sci."},{"key":"ref_11","first-page":"169","article-title":"The locating-chromatic number of disconnected graphs","volume":"94","author":"Welyyanti","year":"2014","journal-title":"Far East J. Math. Sci."},{"key":"ref_12","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_13","first-page":"20","article-title":"Locating-chromatic number for a graph of two components","volume":"1707","author":"Welyyanti","year":"2017","journal-title":"AIP Conf. Proc."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ghanem, M., Al-Ezeh, H., and Dabbour, A. (2019). Locating Chromatic Number of Powers of Paths and Cycles. Symmetry, 11.","DOI":"10.3390\/sym11030389"},{"key":"ref_15","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_16","first-page":"769","article-title":"On some petersen graphs having locating chromatic number four or five","volume":"102","author":"Asmiati","year":"2017","journal-title":"Far East J. Math. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Asmiati, A., Yana, I.K.S.G., and Yulianti, L. (2018). On the locating-chromatic number of certain barbell graphs. Int. J. Math. Math. Sci., 5.","DOI":"10.1155\/2018\/5327504"},{"key":"ref_18","first-page":"245","article-title":"On the locating-chromatic number of homogeneous lobsters","volume":"10","author":"Syofyan","year":"2013","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_19","first-page":"1305","article-title":"On the locating-chromatic numbers of non-homogeneous caterpillars and firecracker graphs","volume":"100","author":"Asmiati","year":"2016","journal-title":"Far East J. Math. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"485","DOI":"10.12988\/imf.2018.8844","article-title":"The locating-chromatic number of subdivision firecrackers graphs","volume":"13","author":"Irawan","year":"2018","journal-title":"Int. Math. Forum"},{"key":"ref_21","first-page":"83","article-title":"Certain operation of generalized petersen graphs having locating-chromatic number five","volume":"22","author":"Irawan","year":"2020","journal-title":"Adv. Appl. Discret. Math."},{"key":"ref_22","first-page":"1491","article-title":"The locating chromatic number of the join of graphs","volume":"40","author":"Behtoei","year":"2014","journal-title":"Bull. Iran. Math. Soc."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.procs.2015.12.093","article-title":"The rainbow conection number of origami graphs and pizza graphs","volume":"74","author":"Nabila","year":"2014","journal-title":"Procedia Comput. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/6\/167\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:09:00Z","timestamp":1760162940000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/6\/167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,27]]},"references-count":23,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,6]]}},"alternative-id":["a14060167"],"URL":"https:\/\/doi.org\/10.3390\/a14060167","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,5,27]]}}}