5 citations · 5 across the 3 of their papers we have counts for
4 papers
A Nordhaus-Gaddum type problem for the normalized Laplacian spectrum and graph Cheeger constant
J. Nolan Faught, Mark Kempton, Adam Knudson
For a graph on vertices with normalized Laplacian eigenvalues and graph complement , we prove that \begin{equation*} \…
Kemeny's constant for non-backtracking random walks
Jane Breen, Nolan Faught, Cory Glover +3
Kemeny's constant for a connected graph is the expected time for a random walk to reach a randomly-chosen vertex , regardless of the choice of the initial vertex. We extend…
A 1-Separation Formula for the Graph Kemeny Constant and Braess Edges
Nolan Faught, Mark Kempton, Adam Knudson
Kemeny's constant of a simple connected graph is the expected length of a random walk from to any given vertex . We provide a simple method for computing Kemeny's…
Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs
Nolan Faught, Mark Kempton, Adam Knudson
We obtain a general formula for the resistance distance (or effective resistance) between any pair of nodes in a general family of graphs which we call flower graphs. Flower graphs…