Title of article
EXTREMAL SKEW ENERGY OF DIGRAPHS WITH NO EVEN CYCLES
Author/Authors
لي، جينگ نويسنده Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China Li, Jing , لي ، ايكسوليانگ نويسنده Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin 300071, China Li, Xueliang , ليان، هوشيو نويسنده Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China Lian, Huishu
Issue Information
فصلنامه با شماره پیاپی 0 سال 2014
Pages
13
From page
37
To page
49
Abstract
Let D be a digraph with skew-adjacency matrix S(D). Then the skew energy of D is defined
as the sum of the norms of all eigenvalues of S(D). Denote by On the class of digraphs of order n with
no even cycles, and by On;m the class of digraphs in On with m arcs. In this paper, we first give the
minimal skew energy digraphs in On and On;m with n ?? 1 m 3
2 (n ?? 1). Then we determine the
maximal skew energy digraphs in On;n and On;n+1, and in the latter case we assume that n is even.
Journal title
Transactions on Combinatorics
Serial Year
2014
Journal title
Transactions on Combinatorics
Record number
1116655
Link To Document