New skew Laplacian energy of a simple digraph
Combinatorics
2013-04-25 v1
Abstract
For a simple digraph of order with vertex set , let and denote the out-degree and in-degree of a vertex in , respectively. Let and . In this paper we introduce to be a new kind of skew Laplacian matrix of , where and is the skew-adjacency matrix of , and from which we define the skew Laplacian energy of as the sum of the norms of all the eigenvalues of . Some lower and upper bounds of the new skew Laplacian energy are derived and the digraphs attaining these bounds are also determined.
Keywords
Cite
@article{arxiv.1304.6465,
title = {New skew Laplacian energy of a simple digraph},
author = {Qingqiong Cai and Xueliang Li and Jiangli Song},
journal= {arXiv preprint arXiv:1304.6465},
year = {2013}
}
Comments
13 pages