{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:59:49Z","timestamp":1780523989445,"version":"3.54.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>A $signed graph$ (or $sigraph$ in short) is an ordered pair $S = (S^u, \\sigma)$, where $S^u$ is a graph $G = (V, E)$ and $\\sigma : E\\rightarrow  \\{+,-\\}$ is a function from the edge set $E$ of $S^u$ into the set $\\{+, -\\}$. For a positive integer $n &gt; 1$, the unitary Cayley graph $X_n$ is the graph whose vertex set is $Z_n$, the integers modulo $n$ and if $U_n$ denotes set of all units of the ring $Z_n$, then two vertices $a, b$ are adjacent if and only if $a-b \\in U_n$. For a positive integer $n &gt; 1$, the unitary Cayley sigraph $\\mathcal{S}_n = (\\mathcal{S}^u_n, \\sigma)$ is defined as the sigraph, where $\\mathcal{S}^u_n$ is the unitary Cayley graph and for an edge $ab$ of $\\mathcal{S}_n$, $$\\sigma(ab) = \\begin{cases} + &amp; \\text{if } a \\in U_n \\text{ or } b \\in U_n,\\\\ - &amp; \\text{otherwise.} \\end{cases}$$ In this paper, we have obtained a characterization of balanced unitary Cayley sigraphs. Further, we have established a characterization of canonically consistent unitary Cayley sigraphs $\\mathcal{S}_n$, where $n$ has at most two distinct odd prime factors.<\/jats:p>","DOI":"10.37236\/716","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:39:14Z","timestamp":1578713954000},"source":"Crossref","is-referenced-by-count":9,"title":["On the Unitary Cayley Signed Graphs"],"prefix":"10.37236","volume":"18","author":[{"given":"Deepa","family":"Sinha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pravin","family":"Garg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2011,12,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p229\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p229\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:58:31Z","timestamp":1579301911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,5]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/716","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,5]]},"article-number":"P229"}}