Let $G$ be a graph of order $n$, and let $s^+(G)$ and $s^-(G)$ denote the sums of the squares of the positive and negative adjacency eigenvalues of $G$, respectively. Recently, Liu, Tang, and Zhang proved the conjecture of Elphick, Farber, Goldberg, and Wocjan that every connected graph $G$ of order $n$ satisfies $ \mi...
S. Akbari, Fu-Tao Hu, Ya-Yang Liu· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.