{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:35Z","timestamp":1753885715662,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"name":"DST-SERB","award":["MTR\/2018\/000447"],"award-info":[{"award-number":["MTR\/2018\/000447"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> The sunlet graph of order eight, denoted by [Formula: see text] is the graph obtained by adding a pendant edge to each vertex of a cycle of length [Formula: see text] We prove that the [Formula: see text]-dimensional hypercube [Formula: see text] can be decomposed into the copies of the graph [Formula: see text] if and only if [Formula: see text] is 4 or [Formula: see text] <\/jats:p>","DOI":"10.1142\/s1793830921501238","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T10:38:07Z","timestamp":1617014287000},"source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of hypercubes into sunlet graphs of order eight"],"prefix":"10.1142","volume":"14","author":[{"given":"A. V.","family":"Sonawane","sequence":"first","affiliation":[{"name":"Department of Mathematics, Savitribai Phule Pune University, Pune 411 007, India"}]},{"given":"Y. M.","family":"Borse","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Savitribai Phule Pune University, Pune 411 007, India"}]}],"member":"219","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"key":"S1793830921501238BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2016.08.001"},{"issue":"3","key":"S1793830921501238BIB002","first-page":"210","volume":"61","author":"Anick D.","year":"2015","journal-title":"Australas. J. Combin."},{"issue":"1","key":"S1793830921501238BIB003","first-page":"33","volume":"2","author":"Anitha R.","year":"2008","journal-title":"Int. J. Math. Comput. Sci."},{"key":"S1793830921501238BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2018.06.003"},{"key":"S1793830921501238BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.07.019"},{"key":"S1793830921501238BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140403"},{"key":"S1793830921501238BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.09.007"},{"key":"S1793830921501238BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.03.007"},{"key":"S1793830921501238BIB009","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700000112"},{"volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","year":"1992","author":"Leighton F. T.","key":"S1793830921501238BIB010"},{"key":"S1793830921501238BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1402-0"},{"key":"S1793830921501238BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/BF01789464"},{"issue":"3","key":"S1793830921501238BIB014","first-page":"443","volume":"74","author":"Tapadia S. A.","year":"2019","journal-title":"Australas. J. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T09:44:57Z","timestamp":1649756697000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921501238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":13,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S1793830921501238"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501238","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,5,10]]},"article-number":"2150123"}}