4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.PR2015★ 4 cited
Polynomial representation for the expected length of minimal spanning trees
Jared Nishikawa, Peter T. Otto, Colin Starr
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly dist…
math.CO2009
Automorphism groups of a graph and a vertex-deleted subgraph
Stephen G. Hartke, Hannah Kolb, Jared Nishikawa +1
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture a…