26 citations · 99 across the 24 of their papers we have counts for
27 papers
Sharp estimates for spanning trees
Steven Klee, Bhargav Narayanan, Lisa Sauermann
We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph on vertices has at most $(1/n^{2}) \prod_{v…
Eigenvalues of graph Laplacians via rank-one perturbations
Steven Klee, Matthew T. Stamps
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version…
Diameters of Cocircuit Graphs of Oriented Matroids: An Update
Ilan Adler, Jesús A. De Loera, Steven Klee +1
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear pr…
Linear algebraic techniques for spanning tree enumeration
Steven Klee, Matthew T. Stamps
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many c…
Linear algebraic techniques for weighted spanning tree enumeration
Steven Klee, Matthew T. Stamps
The weighted spanning tree enumerator of a graph with weighted edges is the sum of the products of edge weights over all the spanning trees in . In the special case that all…
Pure -sequences arising from -dimensional PS ear-decomposable simplicial complexes
Steven Klee, Brian Nugent
We show that the -vector of a -dimensional PS ear-decomposable simplicial complex is a pure -sequence. This provides a strengthening of Stanley's conjecture for…