English

Oriented unicyclic graphs with extremal skew energy

Combinatorics 2011-09-01 v1

Abstract

Let \G\G be an oriented graph of order nn and \a1,\a2,...,\an\a_1,\a_2,..., \a_n denote all the eigenvalues of the skew-adjacency matrix of \G.\G. The skew energy Es(\G)=i=1n\ai.\displaystyle{\cal E}_s(\G)= \sum_{i=1}^{n} |\a_i|. In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.

Keywords

Cite

@article{arxiv.1108.6229,
  title  = {Oriented unicyclic graphs with extremal skew energy},
  author = {Hou Yaoping and Shen Xiaoling and Zhang Chongyan},
  journal= {arXiv preprint arXiv:1108.6229},
  year   = {2011}
}

Comments

10pages, 1 figure

R2 v1 2026-06-21T18:57:48.033Z