{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:29:05Z","timestamp":1753882145962,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"name":"None"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> For an ordered [Formula: see text]-decomposition [Formula: see text] of a connected graph [Formula: see text], the [Formula: see text]-representation of an edge [Formula: see text] is the [Formula: see text]-tuple [Formula: see text], where [Formula: see text] represents the distance from [Formula: see text] to [Formula: see text]. A decomposition [Formula: see text] is resolving if every two distinct edges of [Formula: see text] have distinct representations. The minimum [Formula: see text] for which [Formula: see text] has a resolving [Formula: see text]-decomposition is its decomposition dimension [Formula: see text]. In this paper, decomposition dimension of Cartesian product of paths, cycles and stars is studied. <\/jats:p>","DOI":"10.1142\/s1793830922501154","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T07:59:12Z","timestamp":1654761552000},"source":"Crossref","is-referenced-by-count":0,"title":["Decomposition dimension of Cartesian product of some graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"T.","family":"Reji","sequence":"first","affiliation":[{"name":"Department of Mathematics, Government College, Chittur, Palakkad, Kerala 678104, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5473-6492","authenticated-orcid":false,"given":"R.","family":"Ruby","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Government College, Chittur, Palakkad, Kerala 678104, India"}]}],"member":"219","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"issue":"4","key":"S1793830922501154BIB001","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/PL00007252","volume":"17","author":"Chartrand G.","year":"2001","journal-title":"Graphs Combin."},{"issue":"1","key":"S1793830922501154BIB002","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0012-365X(01)00454-X","volume":"252","author":"Enomoto H.","year":"2002","journal-title":"Discrete Math."},{"issue":"4","key":"S1793830922501154BIB003","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s00373-003-0526-z","volume":"19","author":"Hagita M.","year":"2003","journal-title":"Graphs Combin."},{"issue":"1","key":"S1793830922501154BIB004","first-page":"191","volume":"15","author":"Harary F.","year":"1976","journal-title":"Ars Combin."},{"issue":"3","key":"S1793830922501154BIB005","doi-asserted-by":"crossref","first-page":"2050037","DOI":"10.1142\/S1793830920500378","volume":"12","author":"Nasir R.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"S1793830922501154BIB006","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s10587-004-6417-5","volume":"54","author":"Saenpholphat V.","year":"2004","journal-title":"Czechoslovak Math. J."},{"key":"S1793830922501154BIB007","first-page":"549","volume-title":"Proc. 6th Southeast. Conf. Combinatorics, Graph Theory and Computing","author":"Slater P. J.","year":"1975"},{"key":"S1793830922501154BIB008","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.disc.2014.04.026","volume":"331","author":"Yero I. G.","year":"2014","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:35:17Z","timestamp":1682850917000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":8,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501154"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501154","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,7,11]]},"article-number":"2250115"}}