You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
Positive and negative square energies of graphs
Contributor:
Abiad, Aida;
De Lima, Leonardo;
Desai, Dheer Noal;
Guo, Krystal;
Hogben, Leslie;
Madrid, José
imprint:
University of Wyoming Libraries, 2023
Published in:The Electronic Journal of Linear Algebra
Language:
Not determined
DOI:
10.13001/ela.2023.7827
ISSN:
1081-3810
Origination:
Footnote:
Description:
<jats:p>The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Let $s^+(G), s^-(G)$ denote the sum of the squares of the positive and negative eigenvalues of $G$, respectively. It was conjectured by [Elphick, Farber, Goldberg, Wocjan, Discrete Math. (2016)] that if $G$ is a connected graph of order $n$, then $s^+(G)\geq n-1$ and $s^-(G) \geq n-1$. In this paper, we show partial results towards this conjecture. In particular, numerous structural results that may help in proving the conjecture are derived, including the effect of various graph operations. These are then used to establish the conjecture for several graph classes, including graphs with certain fraction of positive eigenvalues and unicyclic graphs.</jats:p>