J. Alencar

activity

20192022

collaborators

3 papers

math.CO2022

On graphs with eigenvectors in ${1, - 1, 0}$ and the max $k$ -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 ${- 1, 0, 1} .$ We extend the graph parameter…

cs.CG2021

An impossible utopia in distance geometry

Germano Abud, Jorge Alencar, Carlile Lavor +2

The Distance Geometry Problem asks for a realization of a given weighted graph in $R^{K}$ . Two variants of this problem, both originating from protein conformation, are base…

math.SP2019

On graphs with adjacency and signless Laplacian matrix eigenvectors entries in ${- 1, + 1}$

Jorge Alencar, Leonardo de Lima

Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $\pm 1$ ? In this paper, we answer this question for the a…

On graphs with eigenvectors in {1,−1,0} and the max k-cut problem

An impossible utopia in distance geometry

On graphs with adjacency and signless Laplacian matrix eigenvectors entries in {−1,+1}

On graphs with eigenvectors in ${1, - 1, 0}$ and the max $k$ -cut problem

On graphs with adjacency and signless Laplacian matrix eigenvectors entries in ${- 1, + 1}$