{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:35:05Z","timestamp":1773092105481,"version":"3.50.1"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p> A decomposition of a graph is a collection of its edge \u2014 disjoint subgraphs whose union equals the edge set of the graph. A decomposition all of whose members are paths is called a path decomposition. In this paper, we introduce and initiate a study of a new variation of decomposition namely equitable path decomposition of a graph [Formula: see text] which is defined to be a decomposition in which all the members are paths and the lengths of any two paths are differ by at most one in [Formula: see text]. In this paper, we initiate a study on this parameter. <\/jats:p>","DOI":"10.1142\/s1793830924500174","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T01:52:52Z","timestamp":1707875572000},"source":"Crossref","is-referenced-by-count":1,"title":["Equitable path decomposition of graphs"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7350-1920","authenticated-orcid":false,"given":"I.","family":"Sahul Hamid","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Madura College, Madurai 625011, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8427-4887","authenticated-orcid":false,"given":"H.","family":"Shanmuga Priya","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Fatima College, Madurai 625018, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Saravanakumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Thiagarajar College of Engineering, Madurai 625015, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,3,9]]},"reference":[{"issue":"10","key":"S1793830924500174BIB001","first-page":"882","volume":"18","author":"Acharya B. D.","year":"1987","journal-title":"Indian J. Pure Appl. Math."},{"key":"S1793830924500174BIB002","first-page":"94","volume":"3","author":"Arumugam S.","year":"2008","journal-title":"Int. J. Math. Combin."},{"key":"S1793830924500174BIB003","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2004","edition":"4"},{"key":"S1793830924500174BIB004","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56470.x"},{"key":"S1793830924500174BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50009-X"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T04:31:22Z","timestamp":1738038682000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,9]]},"references-count":5,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.1142\/S1793830924500174"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500174","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,9]]},"article-number":"2450017"}}