2 citations · 3 across the 17 of their papers we have counts for
3 papers · 2 filters
Generalizations of the Strong Arnold Property and the minimum number of distinct eigenvalues of a graph
Wayne Barrett, Shaun Fallat, H. Tracy Hall +3
For a given graph G and an associated class of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in G, the collection of all possible spectra for s…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +4
We establish a conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-conca…