{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T22:05:19Z","timestamp":1772057119806,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>An oriented graph $\\overleftarrow{G}$ is a simple  undirected graph $G$ with an orientation, which assigns  to each edge a direction so that $\\overleftarrow{G}$ becomes a directed graph. $G$ is called the underlying graph of $\\overleftarrow{G}$ and we denote by  $S(\\overleftarrow{G})$  the skew-adjacency matrix  of $\\overleftarrow{G}$ and its spectrum $Sp(\\overleftarrow{G})$ is called the skew-spectrum of $\\overleftarrow{G}$.  In this paper,  the coefficients of the characteristic  polynomial  of the skew-adjacency  matrix $S(\\overleftarrow{G}) $ are given in terms of $\\overleftarrow{G}$ and as its applications,  new combinatorial proofs of known results  are obtained and  new families of  oriented bipartite graphs $\\overleftarrow{G}$ with $Sp(\\overleftarrow{G})={\\bf i} Sp(G) $  are given. <\/jats:p>","DOI":"10.37236\/643","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:43:32Z","timestamp":1578696212000},"source":"Crossref","is-referenced-by-count":30,"title":["Characteristic Polynomials of Skew-Adjacency Matrices of Oriented Graphs"],"prefix":"10.37236","volume":"18","author":[{"given":"Yaoping","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiangang","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,8,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p156\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p156\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:07:33Z","timestamp":1579284453000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,5]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/643","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,5]]},"article-number":"P156"}}