Showing math.COShow all
2 papers · 1 filter
math.CO2025
On some classes of bivalent and trivalent planar graphs
Jorge Alencar, Jean-Guy Caputo, Leonardo de Lima +1
A graph is called bivalent or trivalent if there exists an eigenvector of the graph Laplacian composed from {-1,1} or {-1,0,1}, respectively. These bivalent and trivalent eigenvect…
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…