{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:31:08Z","timestamp":1648783868686},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:p> In this paper, we show that the necessary and sufficient condition for the existence of an [Formula: see text]-factorization of [Formula: see text] is n \u2261 0 ( mod k(k - 1)), for all m &gt; 3. In fact, our result together with a result of Ushio gives a complete solution for the existence of an [Formula: see text]-factorization of [Formula: see text] for all m \u2265 3. Further, we have obtained some necessary or sufficient conditions for the existence of an [Formula: see text]-factorization of [Formula: see text], for all even k \u2265 4 and m &gt; 3. <\/jats:p>","DOI":"10.1142\/s1793830914500487","type":"journal-article","created":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T02:31:21Z","timestamp":1401071481000},"page":"1450048","source":"Crossref","is-referenced-by-count":2,"title":["$\\widetilde{S}_k$-Factorization of the symmetric digraph of wreath product of graphs"],"prefix":"10.1142","volume":"06","author":[{"given":"P.","family":"Hemalatha","sequence":"first","affiliation":[{"name":"Department of Mathematics, Vellalar College for Women (Autonomous), Erode 638012, Tamilnadu, India"}]},{"given":"A.","family":"Muthusamy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Periyar University, Salem, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf2","unstructured":"P.\u00a0Hemalatha and A.\u00a0Muthusamy, $\\widehat{S}_k$-factorization of Symmetric Digraph of Tensor Product of Graphs, Ramanujan Mathematical Society Lecture Notes Series\u00a07 (International Press, 2008)\u00a0pp. 233\u2013236."},{"key":"rf3","first-page":"51","volume":"84","author":"Hemalatha P.","year":"2013","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00259-2"},{"key":"rf6","first-page":"69","volume":"20","author":"Ushio K.","year":"1999","journal-title":"Australas. J. Combin."},{"key":"rf7","first-page":"791","volume":"198","author":"Ushio K.","year":"1999","journal-title":"Discrete Math."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00321-0"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00154-5"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00106-4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:46:40Z","timestamp":1565095600000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,10,10]]},"published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10.1142\/S1793830914500487"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500487","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}