4 papers
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…
Effects of Backtracking on PageRank
Cory Glover, Tyler Jones, Mark Kempton +1
In this paper, we consider three variations on standard PageRank: Non-backtracking PageRank, -PageRank, and -PageRank, all of which alter the standard formula by adjust…
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…