2000 character limit reached
Oriented unicyclic graphs with extremal skew energy (1108.6229v1)
Published 31 Aug 2011 in math.CO
Abstract: Let $\G$ be an oriented graph of order $n$ and $\a_1,\a_2,..., \a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\G.$ The skew energy $\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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.