3 papers
math.CO2023
Impartial geodetic building games on graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the set. The convex hull of a set of vertices…
math.CO2018
Laplacian Simplices II: A Coding Theoretic Approach
Marie Meyer, Tefjol Pllaha
This paper further investigates \emph{Laplacian simplices}. A construction by Braun and the first author associates to a simple connected graph a simplex $\cP_G$ whose vertices…
math.CO2017
Laplacian Simplices
Benjamin Braun, Marie Meyer
This paper initiates the study of the "Laplacian simplex" obtained from a finite graph by taking the convex hull of the columns of the Laplacian matrix for . Basic pro…