4 papers
A Nordhaus--Gaddum problem for the spectral gap of a graph
Sooyeong Kim, Neal Madras
Let be a graph on vertices, with complement . The spectral gap of the transition probability matrix of a random walk on is used to estimate how fast the r…
Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem
Sooyeong Kim, Neal Madras, Ada Chan +3
We study Nordhaus-Gaddum problems for Kemeny's constant of a connected graph . We prove bounds on and the pro…
Kemeny's constant and enumerating Braess edges in trees
Jihyeug Jang, Mark Kempton, Sooyeong Kim +3
We study the problem of enumerating Braess edges for Kemeny's constant in trees. We obtain bounds and asympotic results for the number of Braess edges in some families of trees.
Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
Sooyeong Kim, Minho Song
In this paper, we present monotone sequences of lower and upper bounds on the Perron value of a nonngeative matrix, and we study their strict monotonicity. Using those sequences, w…