|
|
|
|
EXTREMAL SKEW ENERGY OF DIGRAPHS WITH NO EVEN CYCLES
|
|
|
|
|
|
|
|
نویسنده
|
لی جینگ ,لی ایکسولیانگ ,لیان هوشیو
|
|
منبع
|
transactions on combinatorics - 2014 - دوره : 3 - شماره : 1 - صفحه:37 -49
|
|
چکیده
|
Let d be a digraph with skew-adjacency matrix s(d). then the skew energy of d is definedas the sum of the norms of all eigenvalues of s(d). denote by on the class of digraphs of order n withno even cycles, and by on;m the class of digraphs in on with m arcs. in this paper, we first give theminimal skew energy digraphs in on and on;m with n ?? 1 m 32 (n ?? 1). then we determine themaximal skew energy digraphs in on;n and on;n+1, and in the latter case we assume that n is even.
|
|
کلیدواژه
|
skew energy ,digraph ,signless matching polynomial ,characteristic polynomial
|
|
آدرس
|
Northwestern Polytechnical University, Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China, China, Nankai University Tianjin, Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P R China, China, Nankai University Tianjin, Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P R China, China
|
|
پست الکترونیکی
|
lhs6803@126.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|