activity
20192026
most citedPositive and Negative Square Energies of Graphs

4 citations · 4 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2026

On distance integral and distance Laplacian integral graphs

S. Pirzada, Ummer Mushtaq, Leonardo de Lima

Let be a connected graph on vertices and let and be the distance and the distance Laplacian matrices associated with . A graph is said to be -in…

math.CO2026

Structured eigenbases and pair state transfer on threshold graphs

Leonardo de Lima, Renata Del-Vecchio, Hermie Monterde +1

Recently, Macharete, Del-Vecchio, Teixeira and de Lima showed that a star and any threshold graph on the same number of vertices share the same eigenbasis relative to the Laplacian…

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.CO2023★ 4 cited

Positive and Negative Square Energies of Graphs

Aida Abiad, Leonardo de Lima, Dheer Noal Desai +3

The energy of a graph is the sum of the absolute values of the eigenvalues of the adjacency matrix of . Let denote the sum of the squares of the positive an…

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…