@article {
author = {Ramane, Harishchandra S. and Nandeesh, K. Channegowda and Gutman, Ivan and Li, Xueliang},
title = {Skew equienergetic digraphs},
journal = {Transactions on Combinatorics},
volume = {5},
number = {1},
pages = {15-23},
year = {2016},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2016.9372},
abstract = {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 energy, and thereby construct non-cospectral, skew equienergetic digraphs on $n$ vertices, for all $n \geq 6$. Thus we arrive at the solution of some open problems proposed in [X. Li, H. Lian, A survey on the skew energy of oriented graphs, arXiv:1304.5707]. },
keywords = {energy of graph,skew energy,skew equienergetic digraphs},
url = {https://toc.ui.ac.ir/article_9372.html},
eprint = {https://toc.ui.ac.ir/article_9372_1d921f94d58d62e8f06d43db2dc426d5.pdf}
}