Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Laura Patuzzi"'
Autor:
Nair Maria Maia de Abreu, Liliana Manuela Gaspar Cerveira da Costa, Carlos Henrique Pereira Nascimento, Laura Patuzzi
Publikováno v:
Trends in Computational and Applied Mathematics, Vol 20, Iss 1 (2019)
The matching polytope of a graph G, denoted by M(G), is the convex hull of the set of the incidence vectors of the matchings G. The graph G(M(G)), whose vertices and edges are the vertices and edges of M(G), is the skeleton of the matching polytope o
Externí odkaz:
https://doaj.org/article/23ac50196f4c4180aab3097400ee3688
Autor:
Carlos Augusto de Alcântara Nascimento, Nair Maria Maia de Abreu, Laura Patuzzi, Liliana Manuela Gaspar Cerveira da Costa
Publikováno v:
Discrete Applied Mathematics. 269:27-31
Let G be a simple graph. A set of pairwise disjoint edges is a matching of G . The matching polytope of G , denoted M ( G ) , is the convex hull of the set of the incidence vectors of the matchings of G . The graph G ( M ( G ) ) , whose vertices and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3ed402466f63c1cd45813eb07ad645c
https://doi.org/10.1016/j.dam.2019.06.020
https://doi.org/10.1016/j.dam.2019.06.020
Publikováno v:
Linear Algebra and its Applications. 496:381-391
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the maximum eigenvalue of the signless Laplacian of a graph of order n that does not contain a specified complete bipartite subgraph. A conjecture is stated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2eadccd6d268b4c6a62b09c895b414d9
https://doi.org/10.1016/j.laa.2016.01.047
https://doi.org/10.1016/j.laa.2016.01.047
Publikováno v:
Linear Algebra and its Applications. 442:106-114
In this article we study the index (the largest eigenvalue of the adjacency matrix) in two special classes of trees, namely: starlike trees and double brooms. For each class, we determine conditions for the index to be integer. We examine conditions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::058fd38a6261a95463aa2d5bba992a0d
https://doi.org/10.1016/j.laa.2013.07.007
https://doi.org/10.1016/j.laa.2013.07.007
Publikováno v:
Filomat. 28:241-248
We characterize when a tree of diameter 4 has integer index and we provide examples of infinite families of non-integral trees with integer index. We also determine a tight upper bound for the index of any tree of diameter 4 based on its maximum degr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::565c94f72a893048eefcbebb6292152f
https://doi.org/10.2298/fil1402241p
https://doi.org/10.2298/fil1402241p
Autor:
Carlos Henrique Pereira Nascimento, Nair Maria Maia de Abreu, Laura Patuzzi, Liliana Manuela Gaspar Cerveira da Costa
Publikováno v:
TEMA (São Carlos). 20:189
The matching polytope of a graph G, denoted by M(G), is the convex hull of the set of the incidence vectors of the matchings G. The graph G(M(G)), whose vertices and edges are the vertices and edges of M(G), is the skeleton of the matching polytope o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db0c2dee119f31374dab79b929b921b6
https://doi.org/10.5540/tema.2019.020.01.189
https://doi.org/10.5540/tema.2019.020.01.189
Publikováno v:
The Electronic Journal of Linear Algebra. 26
This paper gives tight upper bounds on the largest eigenvalue q (G) of the signless Laplacian of graphs with no 4-cycle and no 5-cycle. If n is odd, let Fn be the friendship graph of order n; if n is even, let Fn be Fn−1 with an extra edge hung to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6f013ce82ba7651318153a27b5d3227
https://doi.org/10.13001/1081-3810.1695
https://doi.org/10.13001/1081-3810.1695