On the unitary Cayley signed graphs (Q665749)

Summary: 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 > 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 > 1\), the unitary Cayley sigraph \(\mathcal S_{n }= (\mathcal S_{n }^{u},\sigma \)) is defined as the sigraph, where \(\mathcal S_{n }^{u}\) is the unitary Cayley graph and for an edge \(ab\) of \(\mathcal S_{n }\), \(\sigma (ab)=+\) if \(a\in U_{n}\) or \(b\in U_{n}\) and \(\sigma (ab)=-\) otherwise. 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.