1 citations · 1 across the 3 of their papers we have counts for
3 papers
Kemeny's constant and Braess cliques in graphs
Jane Breen, Emma deBlieck, Kevin N. Vander Meulen
Kemeny's constant is used as a measure of the average travel time on a graph. Braess' paradox for graphs is the observation that in some graphs, when an edge is added, Kemeny's con…
Bordering of Symmetric Matrices and an Application to the Minimum Number of Distinct Eigenvalues for the Join of Graphs
Aida Abiad, Shaun M. Fallat, Mark Kempton +5
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the j…
Condition Numbers of Hessenberg Companion Matrices
Michael Cox, Kevin N. Vander Meulen, Adam Van Tuyl +1
The Fiedler matrices are a large class of companion matrices that include the well-known Frobenius companion matrix. The Fiedler matrices are part of a larger class of companion ma…