New skew Laplacian energy of a simple digraph

preprint2013arXivOpen access

Abstract

For a simple digraph GG of order nn with vertex set {v1,v2,…,vn}\{v_1,v_2,\ldots, v_n\}, let di+d_i^+ and di−d_i^- denote the out-degree and in-degree of a vertex viv_i in GG, respectively. Let D+(G)=diag(d1+,d2+,…,dn+)D^+(G)=diag(d_1^+,d_2^+,\ldots,d_n^+) and D−(G)=diag(d1−,d2−,…,dn−)D^-(G)=diag(d_1^-,d_2^-,\ldots,d_n^-). In this paper we introduce SL~(G)=D~(G)−S(G)\widetilde{SL}(G)=\widetilde{D}(G)-S(G) to be a new kind of skew Laplacian matrix of GG, where D~(G)=D+(G)−D−(G)\widetilde{D}(G)=D^+(G)-D^-(G) and S(G)S(G) is the skew-adjacency matrix of GG, and from which we define the skew Laplacian energy SLE(G)SLE(G) of GG as the sum of the norms of all the eigenvalues of SL~(G)\widetilde{SL}(G). Some lower and upper bounds of the new skew Laplacian energy are derived and the digraphs attaining these bounds are also determined.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.