{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T04:20:41Z","timestamp":1743481241164},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p>Let p be a prime e be a positive integer, [Formula: see text], and let [Formula: see text] denote the finite field of q elements. Let [Formula: see text], [Formula: see text], be integers. The monomial digraph [Formula: see text] is defined as follows: the vertex set of D is [Formula: see text], and [Formula: see text] is an arc in D if [Formula: see text]. In this note we study the question of isomorphism of monomial digraphs [Formula: see text] and [Formula: see text]. Several necessary conditions and several sufficient conditions for the isomorphism are found. We conjecture that one simple sufficient condition is also a necessary one.<\/jats:p>","DOI":"10.1142\/s0219265917410067","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T08:47:39Z","timestamp":1513327659000},"page":"1741006","source":"Crossref","is-referenced-by-count":1,"title":["A Note on the Isomorphism Problem for Monomial Digraphs"],"prefix":"10.1142","volume":"17","author":[{"given":"ALEKSANDR","family":"KODESS","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Rhode Island, Kingston, RI 02881, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FELIX","family":"LAZEBNIK","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80037-1"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20055"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80068-0"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1090\/S1061-0022-04-00833-7"},{"issue":"3","key":"p_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/5052","volume":"22","author":"Kodess A.","year":"2015","journal-title":"Electron J Combin"},{"key":"p_11","first-page":"105","volume":"14","author":"Lazebnik F.","year":"2017","journal-title":"Lecture Notes of Seminario Interdisciplinare di Matematica"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.1024"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)90119-X"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611503014412"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(87)80018-5"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265917410067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T09:50:15Z","timestamp":1603533015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265917410067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":10,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2017,12,15]]},"published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1142\/S0219265917410067"],"URL":"https:\/\/doi.org\/10.1142\/s0219265917410067","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}