Date of Submission
Academic Programs and Concentrations
Project Advisor 1
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
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Shao, Yida, "Counting Trees in Ladder Graphs" (2018). Senior Projects Spring 2018. 39.