Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.

let $d$ be a digraph with skew-adjacency matrix $s(d)$‎. ‎the skew‎ ‎energy of $d$ is defined as the sum of the norms of all‎ ‎eigenvalues of $s(d)$‎. ‎two digraphs are said to be skew‎ ‎equienergetic if their skew energies are equal‎. ‎we establish an‎ ‎expression for the characteristic polynomial of the skew‎ ‎adjacency matrix of the join of two digraphs‎, ‎and for the‎ ‎respective skew energ...

Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...

let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...

Divisible design digraphs are constructed from skew balanced generalized weighing matrices and Hadamard matrices. Commutative non-commutative association schemes shown to be attached the divisible digraphs.

In this paper, skew ABC matrix and its energy are introduced for digraphs. Firstly, some fundamental spectral features of the digraphs established. Then upper lower bounds presented Further extremal determined attaining these bounds.

We show that, contrary to the claims of several authors that there exists no equienergetic graphs on seven vertices, there exists 21 sets of noncospectral, equienergetic graphs on seven vertices. We also give the number and cardinality of sets of equienergetic connected graphs on eight, nine and ten vertices, and equienergetic trees and chemical trees on up to 22 vertices. Finally, we construct...

for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...