3 papers
math.CO2022
On graphs with eigenvectors in and the max -cut problem
Jorge Alencar, Leonardo de Lima, Vladimir Nikiforov
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to We extend the graph parameter…
math.CO2020
Laplacian integral graphs with a given degree sequence constraint
Anderson Fernandes Novanta, Carla S. Oliveira, Leonardo S. de Lima
Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) - A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matri…
math.SP2019
On graphs with adjacency and signless Laplacian matrix eigenvectors entries in
Jorge Alencar, Leonardo de Lima
Let be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by ? In this paper, we answer this question for the a…