5 citations · 16 across the 17 of their papers we have counts for
29 papers · 1 filter
Nordhaus-Gaddum upper bounds for graph connectivity parameters
Mark Kempton, Xavier Zaitzeff, Sibi Muthuprakash
We examine upper bounds on Nordhaus-Gaddum type problems for parameters related to graph connectivity. Our main result is that for a graph on vertices where both and it…
On defining Kemeny's constant for non-backtracking random walks
Jane Breen, Mark Kempton, Adam Knudson +1
We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that th…
Two Distinct Eigenvalues from a New Graph Product
Eric Culver, Mark Kempton
The parameter of a graph is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by . We introduce a novel graph product by which w…
A Ricci flow on graphs from effective resistance
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study…
Node resistance curvature in Cartesian graph products
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
Devriendt and Lambiotte recently introduced the \emph{node resistance curvature}, a notion of graph curvature based on the effective resistance matrix. In this paper, we begin the…
Pretty good fractional revival via magnetic fields: theory and examples
Whitney Drazen, Mark Kempton, Gabor Lippner
We develop the theory of pretty good quantum fractional revival in arbitrary sized subsets of a graph, including the theory for fractional cospectrality of subsets of arbitrary siz…