Nair Abreu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Nair Abreu has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Domingos Moreira Cardoso
Universidade de Aveiro
3 shared publications - Carlos Henrique Do Nascimento
Univ Fed Fluminense, Inst Ciencias Exatas, Volta Redonda, Brazil
2 shared publications - Claudia Marcela Justel
Instituto Militar de Engenharia, Brasil
2 shared publications Cybele T. M. Vinagre
Instituto de Matemática e Estatística Universidade Federal Fluminense Niterói Brasil
2 shared publications- Laura Patuzzi
Univ Fed Rio de Janeiro, Inst Matemat, Rio De Janeiro, Brazil
2 shared publications - Lilian Markenzon
Universidade Federal do Rio de Janeiro
2 shared publications
Latest Publications
- 17 November 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 682, 351-362
Strictly chordal graphs: Structural properties and integer Laplacian eigenvalues
- 17 November 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 682, 351-362
Strictly chordal graphs: Structural properties and integer Laplacian eigenvalues
- Open Access
Integer Laplacian eigenvalues of strictly chordal graphs
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be efficiently implemented. Firstly we review results concerning general graphs showing that the number of universal vertices and the degree of false and true twins provide integer Laplacian eigenvalues and their multiplicities. Afterwards, we prove that many integer Laplacian eigenvalues of a strictly chordal graph are directly related to particular simplicial vertex sets and to the minimal vertex separators of the graph.
Open AccessInteger Laplacian eigenvalues of strictly chordal graphs
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be efficiently implemented. Firstly we review results concerning general graphs showing that the number of universal vertices and the degree of false and true twins provide integer Laplacian eigenvalues and their multiplicities. Afterwards, we prove that many integer Laplacian eigenvalues of a strictly chordal graph are directly related to particular simplicial vertex sets and to the minimal vertex separators of the graph.
- 1 November 2019
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 39 (1) , 12
Some new aspects of main eigenvalues of graphs
- 1 November 2019
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 39 (1) , 12
Some new aspects of main eigenvalues of graphs
- 1 September 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 269, 27-31
Skeleton matching polytope: Realization and isomorphism
- 1 September 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 269, 27-31
Skeleton matching polytope: Realization and isomorphism
- Open Access
On the vertex degrees of the skeleton of the matching polytope of a graph
The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is the skeleton of the matching polytope of G, denoted G(M(G)). Since the number of vertices of G(M(G)) is huge, the structural properties of these graphs have been studied in particular classes. In this paper, for an arbitrary graph G, we obtain a formulae to compute the degree of a vertex of G(M(G)) and prove that the minimum degree of G(M(G)) is equal to the number of edges of G. Also, we identify the vertices of the skeleton with the minimum degree and characterize regular skeletons of the matching polytopes.
Open AccessOn the vertex degrees of the skeleton of the matching polytope of a graph
The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is the skeleton of the matching polytope of G, denoted G(M(G)). Since the number of vertices of G(M(G)) is huge, the structural properties of these graphs have been studied in particular classes. In this paper, for an arbitrary graph G, we obtain a formulae to compute the degree of a vertex of G(M(G)) and prove that the minimum degree of G(M(G)) is equal to the number of edges of G. Also, we identify the vertices of the skeleton with the minimum degree and characterize regular skeletons of the matching polytopes.
- Open Access
On main eigenvalues of certain graphs
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main eigenvalues are considered and a relation between those main eigenvalues is presented. The particular case of harmonic graphs is analyzed and they are characterized in terms of their main eigenvalues without any restriction on its combinatorial structure. We give a necessary and sufficient condition for a graph $G$ to have $-1-\lambda_{\min}$ as an eigenvalue of its complement, where $\lambda_{\min}$ denotes the least eigenvalue of $G$. Also, we prove that among connected bipartite graphs, $K_{r,r}$ is the unique graph for which the index of the complement is equal to $-1-\lambda_{\min}$. Finally, we characterize all paths and all double stars (trees with diameter three) for which the smallest eigenvalue is non-main. Main eigenvalues of paths and double stars are identified.Open AccessOn main eigenvalues of certain graphs
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main eigenvalues are considered and a relation between those main eigenvalues is presented. The particular case of harmonic graphs is analyzed and they are characterized in terms of their main eigenvalues without any restriction on its combinatorial structure. We give a necessary and sufficient condition for a graph $G$ to have $-1-\lambda_{\min}$ as an eigenvalue of its complement, where $\lambda_{\min}$ denotes the least eigenvalue of $G$. Also, we prove that among connected bipartite graphs, $K_{r,r}$ is the unique graph for which the index of the complement is equal to $-1-\lambda_{\min}$. Finally, we characterize all paths and all double stars (trees with diameter three) for which the smallest eigenvalue is non-main. Main eigenvalues of paths and double stars are identified. - Open Access
- 1 December 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (4) , 379-390
Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
A bug Bugp,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Priand Pr2 by one of their end vertices at u and v, respectively. Let Q(G) be the signless Laplacian matrix of a graph G and q1(G) be the spectral radius of Q(G). It is known that the bug maximizes q1(G) among all graphs G of order n and diameter d. For a bug B of order n and diameter d, n - d is an eigenvalue of Q(B) with multiplicity n - d - 1. In this paper, we prove that remainder d +1 eigenvalues of Q(B), among them q1(B), can be computed as the eigenvalues of a symmetric tridiagonal matrix of order d +1. Finally, we show that q1(B0) can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order whenever d is even.
- 1 December 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (4) , 379-390
Open AccessComputing the maximal signless Laplacian index among graphs of prescribed order and diameter
A bug Bugp,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Priand Pr2 by one of their end vertices at u and v, respectively. Let Q(G) be the signless Laplacian matrix of a graph G and q1(G) be the spectral radius of Q(G). It is known that the bug maximizes q1(G) among all graphs G of order n and diameter d. For a bug B of order n and diameter d, n - d is an eigenvalue of Q(B) with multiplicity n - d - 1. In this paper, we prove that remainder d +1 eigenvalues of Q(B), among them q1(B), can be computed as the eigenvalues of a symmetric tridiagonal matrix of order d +1. Finally, we show that q1(B0) can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order whenever d is even.
- Open Access
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Consider two graphs $G$ and $H$. Let $H^k[G]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k[G]$ and $H^k$ when $G$ and $H$ are regular and the Laplacian spectrum of $H^k[G]$ and $H^k$ for $G$ and $H$ arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, $10^{100}$) of vertices is determined. The paper finish with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.Open AccessSpectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Consider two graphs $G$ and $H$. Let $H^k[G]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k[G]$ and $H^k$ when $G$ and $H$ are regular and the Laplacian spectrum of $H^k[G]$ and $H^k$ for $G$ and $H$ arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, $10^{100}$) of vertices is determined. The paper finish with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers. - Open Access
- 1 June 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (2) , 175-190
The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
A complete caterpillar is a caterpillar in which each internal vertex is a quasi-pendent vertex. In this paper, in the class of all complete caterpillars on n vertices and diameter d, the caterpillar attaining the largest Laplacian index is determined. In addition, it is proved that this caterpillar also attains the largest adjacency index.
- 1 June 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (2) , 175-190
Open AccessThe largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
A complete caterpillar is a caterpillar in which each internal vertex is a quasi-pendent vertex. In this paper, in the class of all complete caterpillars on n vertices and diameter d, the caterpillar attaining the largest Laplacian index is determined. In addition, it is proved that this caterpillar also attains the largest adjacency index.
- 1 April 2010
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 432 (9) , 2342-2351
Bounds on the -spread of a graph- 1 April 2010
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 432 (9) , 2342-2351
Bounds on the -spread of a graph