Luiz Emílio Allem

collaborators

2 papers

math.CO2023

Diminimal families of arbitrary diameter

Luiz Emilio Allem, Rodrigo Orsini Braga, Carlos Hoppen +3

Given a tree $T$ , let $q (T)$ be the minimum number of distinct eigenvalues in a symmetric matrix whose underlying graph is $T$ . It is well known that $q (T) \geq d (T) + 1$ , where $d(T)…

math.CO2017

Partial characterization of graphs having a single large Laplacian eigenvalue

L. Emilio Allem, Antonio Cafure, Ezequiel Dratman +3

The parameter $σ (G)$ of a graph $G$ stands for the number of Laplacian eigenvalues greater than or equal to the average degree of $G$ . In this work, we address the problem of chara…