Laura Patuzzi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Laura Patuzzi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Henrique Do Nascimento
Univ Fed Fluminense, Inst Ciencias Exatas, Volta Redonda, Brazil
2 shared publications - Liliana Manuela Gaspar Cerveira da Costa
Colégio Pedro II
2 shared publications - Nair Abreu
PEP/COPPE Universidade Federal do Rio de Janeiro Rio de Janeiro Brasil
2 shared publications
Latest Publications
- 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.