{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T04:58:58Z","timestamp":1770958738947,"version":"3.50.1"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,3]]},"abstract":"<jats:p>For a finite commutative ring R and a positive integer k, let G(R, k) denote the digraph whose set of vertices is R and for which there is a directed edge from a to a<jats:sup>k<\/jats:sup>. The digraph G(R, k) is called symmetric of order M if its set of connected components can be partitioned into subsets of size M with each subset containing M isomorphic components. We primarily aim to factor G(R, k) into the product of its subdigraphs. If the characteristic of R is a prime p, we obtain several sufficient conditions for G(R, k) to be symmetric of order M.<\/jats:p>","DOI":"10.1142\/s1793830914500645","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T08:31:58Z","timestamp":1412152318000},"page":"1450064","source":"Crossref","is-referenced-by-count":2,"title":["On the symmetric digraphs from the<i>k<\/i>th power mapping on finite commutative rings"],"prefix":"10.1142","volume":"07","author":[{"given":"Guixin","family":"Deng","sequence":"first","affiliation":[{"name":"College of Mathematical Sciences, Guangxi Teachers Education University, Nanning 530023, P. R. China"}]},{"given":"Lawrence","family":"Somer","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Catholic University of America, Washington, DC 20064, USA"}]}],"member":"219","published-online":{"date-parts":[[2015,2,2]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0957-8"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/s10587-008-0009-8"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.4236\/ojdm.2011.13013"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.11.007"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2011.07.008"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00250-M"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1023\/B:CMAJ.0000042385.93571.58"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.009"},{"key":"rf10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1080\/00150517.2012.12427990","volume":"50","author":"Somer L.","year":"2012","journal-title":"Fibonacci Quart."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:11:32Z","timestamp":1746400292000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2015,2,2]]},"published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1142\/S1793830914500645"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500645","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,2]]}}}