Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Abreu, Nair"'
Publikováno v:
In Linear Algebra and Its Applications 1 February 2024 682:351-362
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 im
Externí odkaz:
http://arxiv.org/abs/2007.06681
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and algebraic co
Externí odkaz:
http://arxiv.org/abs/1907.04979
Autor:
Abreu, Nair Júlia Andrade de
Publikováno v:
Repositório Institucional da UFCUniversidade Federal do CearáUFC.
ABREU, Nair Júlia Andrade de. Percepção dos riscos de inundações no Bairro Preguiça – Maranguape (CE). 2015. 140 f. Dissertação (Mestrado em geografia)- Universidade Federal do Ceará, Fortaleza-CE, 2015.
Submitted by Elineudson Ribeir
Submitted by Elineudson Ribeir
Externí odkaz:
http://www.repositorio.ufc.br/handle/riufc/20233
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, denote
Externí odkaz:
http://arxiv.org/abs/1701.06210
Publikováno v:
Comp. Appl. Math. 39, 12 (2020)
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
Externí odkaz:
http://arxiv.org/abs/1605.03533
Publikováno v:
In Linear Algebra and Its Applications 1 April 2021 614:68-81
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
Externí odkaz:
http://arxiv.org/abs/1511.02391
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 2, Pp 379-391 (2020)
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette characterized all graphs with all but two eigenvalues equal to −2 and 0. In this article, we extend their result by characterizing explicitly all
Externí odkaz:
https://doaj.org/article/af53bfa58a0f40699d89f32a871ae280
Publikováno v:
Electronic J. Linear Algebra 23 (2012), 782-789
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of given order and clique number. More precisely, let G be a graph of order n, let A be its adjacency matrix, and let D be the diagonal matrix of the row-
Externí odkaz:
http://arxiv.org/abs/1308.1653