2 papers
math.CO2017
On the vertex degrees of the skeleton of the matching polytope of a graph
Nair Abreu, Liliana Costa, Carlos Henrique do Nascimento +1
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 a…
math.CO2015
Maxima of the Q-index: graphs with no K_s,t
Maria Aguieiras A. de Freitas, Vladimir Nikiforov, Laura Patuzzi
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 that does not…