Date of Submission

Spring 2018

Academic Programs and Concentrations


Project Advisor 1

Ethan Bloch

Abstract/Artist's Statement

A tree in a graph is a subgraph that is connected and has no cycles. A spanning tree in a graph is a tree that contains all vertices of the graph. If we pick a tree randomly in a ladder graph, what is the probability the tree will be a spanning tree? We will explore the answer to this question for ladders with a small number of vertices.

Open Access Agreement

On-Campus only

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.