2 citations · 3 across the 4 of their papers we have counts for
5 papers
Adjacency Energy of Hypergraphs
Kauê Cardoso, Renata Del-Vecchio, Lucas Portugal +1
In this paper, we define and obtain several properties of the (adjacency) energy of a hypergraph. In particular, bounds for this energy are obtained as functions of structural and…
The determinant of the distance matrix of graphs with at most two cycles
Ezequiel Dratman, Luciano N. Grippo, Matín D. Safe +2
Let be a connected graph on vertices and its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known wh…
New bounds for the b-chromatic number of vertex deleted graphs
Renata Del-Vecchio, Mekkia Kouider
A b-coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex adjacent to at least one vertex of every other color class. The b-chromati…
Cograph generation with linear delay
Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio
Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cog…
Laplacian integrality in P4-sparse and P4-extendible graphs
Renata Del-Vecchio, Atila Jones
Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph…