13 citations · 28 across the 11 of their papers we have counts for
8 papers · 1 filter
On the spectrum and expansion of graph associahedra
Ana Gargantini, Adrián Pastine, Pablo Torres +1
In this article, we contribute to the spectral analysis of graph associahedra by providing a lower bound for the second largest eigenvalue of . Furthermore, using e…
Exact distance Kneser graphs
Agustina Victoria Ledezma, Adrián Pastine, Mario Valencia-Pabon
For any graph and positive integer , the exact distance- graph is the graph with vertex set , where two vertices are adjacent if and only if the dista…
The rotation distance of brooms
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
The associahedron of a graph has the property that its vertices can be thought of as the search trees on and its edges as the rotations between two search…
On restricted completions of chordal and trivially perfect graphs
Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon
Let be a graph having a vertex such that is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…
On the diameter of Schrijver graphs
Agustina Victoria Ledezma, Adrián Pastine, Pablo Torres +1
For and , the well known Kneser graph has all -element subsets of an -element set as vertices; two such subsets are adjacent if…
Diameter estimates for graph associahedra
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph encodes the combinatorics…
Shifts of the Stable Kneser Graphs and Hom-Idempotence
Pablo Torres, Mario Valencia-Pabon
A graph is said to be {\em hom-idempotent} if there is a homomorphism from to , and {\em weakly hom-idempotent} if for some there is a homomorphism from $G^…
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
L. Alcón, F. Bonomo, G. Durán +4
Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate…