Document Type

Thesis

Degree Name

Master of Science (MSc)

Department

Mathematics

Faculty/School

Faculty of Science

First Advisor

Kathie Cameron

Advisor Role

Guidance and support throughout the reaserch process

Abstract

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.

Convocation Year

2023

Convocation Season

Fall

Download

Share

COinS