3 citations · 3 across the 5 of their papers we have counts for
5 papers
Conic programming to understand sums of squares of eigenvalues of graphs
Gabriel Coutinho, Thomás Jung Spier, Shengtong Zhang
In this paper we prove a conjecture by Wocjan, Elphick and Anekstein (2018) which upper bounds the sum of the squares of the positive (or negative) eigenvalues of the adjacency mat…
Sums of squares of eigenvalues and the vector chromatic number
Gabriel Coutinho, Thomás Jung Spier
In this short paper we prove that the sum of the squares of negative (or positive) eigenvalues of the adjacency matrix of a graph is lower bounded by the sum of the degrees divided…
No perfect state transfer in trees with more than 3 vertices
Gabriel Coutinho, Emanuel Juliano, Thomás Jung Spier
We prove that the only trees that admit perfect state transfer according to the adjacency matrix model are and . This answers a question first asked by Godsil in 2012 an…
The spectrum of symmetric decorated paths
Gabriel Coutinho, Emanuel Juliano, Thomás Jung Spier
The main result of this paper states that in a rooted product of a path with rooted graphs which are disposed in a somewhat mirror-symmetric fashion, there are distinct eigenvalues…
Irrational quantum walks
Gabriel Coutinho, Pedro Ferreira Baptista, Chris Godsil +2
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenva…