2023/03/21 by Aida Abiad, Leonardo de Lima, Abiad, Aida +9
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Matrix Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.2303.11930
openalex publication_date 2023/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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)≥ n-1 and s-(G) ≥ 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.