Number of Spanning Trees
Presenter(s)
Jonathan West
Files
Description
This project is for the course MTH 466: Graph Theory and Combinatorics. A graph is a mathematical object that consists of two sets: a set of vertices and a set of edges. An edge joins two vertices and depicts a relationship between those vertices. A graph is said to be connected if, for any two vertices of the graph, there exists a sequence of edges that is a path between them. A subgraph of a graph is called a spanning tree if it is connected and contains every vertex of the graph while containing no cycles. This project will explore the process of determining the number of different spanning trees on a connected graph with labeled vertices. We will also consider the same question for unlabeled graphs and make a comparison between the two approaches.
Publication Date
4-23-2025
Project Designation
Course Project - MTH 466 01
Primary Advisor
Aparna W. Higgins
Primary Advisor's Department
Mathematics
Keywords
Stander Symposium, College of Arts and Sciences
Institutional Learning Goals
Scholarship
Recommended Citation
"Number of Spanning Trees" (2025). Stander Symposium Projects. 4153.
https://ecommons.udayton.edu/stander_posters/4153
Comments
10:45-12:00, Kennedy Union Ballroom