New skew Laplacian energy of a simple digraph

Abstract

For a simple digraph G of order n with vertex set \v1,v2,…, vn\, let di+ and di- denote the out-degree and in-degree of a vertex vi in G, respectively. Let D+(G)=diag(d1+,d2+,…,dn+) and D-(G)=diag(d1-,d2-,…,dn-). In this paper we introduce SL(G)=D(G)-S(G) to be a new kind of skew Laplacian matrix of G, where D(G)=D+(G)-D-(G) and S(G) is the skew-adjacency matrix of G, and from which we define the skew Laplacian energy SLE(G) of G as the sum of the norms of all the eigenvalues of SL(G). Some lower and upper bounds of the new skew Laplacian energy are derived and the digraphs attaining these bounds are also determined.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…