2014
DOI: 10.13001/1081-3810.1961
|View full text |Cite
|
Sign up to set email alerts
|

On oriented graphs with minimal skew energy

Abstract: Let S(G σ ) be the skew-adjacency matrix of an oriented graph G σ . The skew energy of G σ is defined as the sum of all singular values of its skewadjacency matrix S(G σ ). In this paper, we first deduce an integral formula for the skew energy of an oriented graph. Then we determine all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n − 2)) arcs, which is an analogy to the conjecture for the energy of undirected graphs proposed by Caporossi et al.[G… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 26 publications
(27 reference statements)
0
1
0
Order By: Relevance
“…Gong, Li and Xu [26] proved that all the coefficients of skew characteristic polynomials are nonnegative.…”
Section: Skew Characteristic Polynomials Of Oriented Graphsmentioning
confidence: 99%
“…Gong, Li and Xu [26] proved that all the coefficients of skew characteristic polynomials are nonnegative.…”
Section: Skew Characteristic Polynomials Of Oriented Graphsmentioning
confidence: 99%