4 citations · 4 across the 4 of their papers we have counts for
4 papers
Area, Perimeter, Height, and Width of Rectangle Visibility Graphs
John S. Caughman, Charles L. Dunn, Joshua D. Laison +2
A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph corr…
Finite Prime Distance Graphs and 2-Odd Graphs
Joshua D. Laison, Colin Starr, Andrea Walker
A graph is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of…
Prime Power and Prime Product Distance Graphs
Joshua D. Laison, Yumi Li, Jeffrey Schreiner-McGraw +1
A graph is a -prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is t…
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…