5 citations · 17 across the 20 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
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…
cs.NI2021
SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks
Stephen Young, Sinan Aksoy, Jesun Firoz +5
In recent years, graph theoretic considerations have become increasingly important in the design of HPC interconnection topologies. One approach is to seek optimal or near-optimal…