Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2 (Q2250379)

Let \(S(G^\sigma)\) be the skew-adjacency matrix of an oriented graph \(G^\sigma\) with \(n\) vertices, and \(\lambda_1,\lambda_2,\ldots,\lambda_n\) be all eigenvalues of \(S(G^\sigma).\) The skew-spectral radius of \(G^\sigma\) is defined as \(\max\{| \lambda_1|,| \lambda_2|,\ldots, | \lambda_n|\}.\) A connected graph in which the number of edges equals the number of vertices is called a unicylic graph. The authors determine the oriented unicylic graphs whose skew-spectral radius does not exceed \(2\). Their result sheds some light on the difference between the (adjacency) spectral radius of an undirected graph and the skew-spectral radius of its corresponding oriented graph. Furthermore, they order all the oriented unicyclic graphs with \(n\) vertices whose skew-spectral radius is bounded by \(2\).