Master of Science (MSc)
Faculty of Science
Guidance and support throughout the reaserch process
A spanning tree of a graph G is a connected acyclic subgraph of G that includes all of the vertices in G. The degree of a vertex is the number of edges incident to that vertex. Given a spanning tree T of a graph G, an opposite tree of T is a spanning tree of G where the degree of each of its vertices is different from its degree in T. For complete, complete bipartite, and complete multipartite graphs, we give the conditions spanning trees of these graphs must satisfy in order to have an opposite tree.
Goossens, Theo, "Opposite Trees" (2023). Theses and Dissertations (Comprehensive). 2563.
Available for download on Friday, May 24, 2024