{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:18:36Z","timestamp":1761581916692,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A digraph $\\Gamma$ is called $n$-Cayley digraph over a group $G$\u200e, \u200eif there exists a semiregular subgroup $R_G$ of Aut$(\\Gamma)$ isomorphic to $G$ with $n$ orbits\u200e. \u200eIn this paper\u200e, \u200ewe represent the adjacency matrix of $\\Gamma$ as a diagonal block\u200e \u200ematrix in terms of irreducible representations of $G$ and determine its characteristic polynomial\u200e. \u200eAs corollaries of this result we find\u200e:\u00a0 \u200ethe spectrum of\u00a0 semi-Cayley graphs over abelian groups\u200e, \u200ea relation between the characteristic polynomial of an $n$-Cayley graph and its complement\u200e, \u200eand\u00a0\u00a0 the spectrum of\u200e \u200eCalye graphs over groups with cyclic subgroups\u200e. \u200eFinally we determine the eigenspace of $n$-Cayley digraphs and their main eigenvalues\u200e.<\/jats:p>","DOI":"10.37236\/3105","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:21:32Z","timestamp":1578705692000},"source":"Crossref","is-referenced-by-count":10,"title":["On the Characteristic Polynomial of $n$-Cayley Digraphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Majid","family":"Arezoomand","sequence":"first","affiliation":[]},{"given":"Bijan","family":"Taeri","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,10,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p57\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p57\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:12:22Z","timestamp":1579259542000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i3p57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,7]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,7,19]]}},"URL":"https:\/\/doi.org\/10.37236\/3105","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,10,7]]},"article-number":"P57"}}