{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:04Z","timestamp":1753884964323,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p> Given an ordered [Formula: see text]-decomposition [Formula: see text] of a connected graph [Formula: see text], the representation of an edge [Formula: see text] with respect to the decomposition [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] of [Formula: see text] is a resolving decomposition if for every pair of edges [Formula: see text]. 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, upper bounds for the decomposition dimension of some class of graphs are determined. <\/jats:p>","DOI":"10.1142\/s1793830922501403","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T04:19:30Z","timestamp":1660709970000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounds for the decomposition dimension of some class of graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Jinitha","family":"Varughese","sequence":"first","affiliation":[{"name":"Department of Mathematics, B. K. College, Amalagiri, Kottayam, Kerala 686561, India"}]},{"given":"T.","family":"Reji","sequence":"additional","affiliation":[{"name":"Department of Mathematics, B. K. College, Amalagiri, Kottayam, Kerala 686561, India"},{"name":"Department of Mathematics, Government College, Chittur, Palakkad, Kerala 678104, India"}]}],"member":"219","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"S1793830922501403BIB001","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/PL00007252","volume":"17","author":"Chartrand G.","year":"2001","journal-title":"Graphs Combin."},{"key":"S1793830922501403BIB002","first-page":"DS6","volume":"8","author":"Gallian J. A.","year":"2017","journal-title":"Elect. J. Combin."},{"key":"S1793830922501403BIB003","first-page":"191","volume":"15","author":"Harary F.","year":"2008","journal-title":"Ars Combin."},{"key":"S1793830922501403BIB004","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10543409308835060","volume":"3","author":"Johnson M. A.","year":"1993","journal-title":"J. Biofarm. Statist."},{"key":"S1793830922501403BIB005","first-page":"549","volume":"14","author":"Slater P. J.","year":"1975","journal-title":"Proc. 6th Southeastern Conf. Combinatorics, Graph Theory Comput., Congr. Numer."},{"journal-title":"Discrete Math. Algorithms Appl.","year":"2022","author":"Reji T.","key":"S1793830922501403BIB007"},{"issue":"4","key":"S1793830922501403BIB008","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":"S1793830922501403BIB009","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."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:40:09Z","timestamp":1686213609000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":8,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.1142\/S1793830922501403"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501403","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,9,26]]},"article-number":"2250140"}}