Presenter(s)

    Connor Seng

    Comments

    10:45-12:00, Kennedy Union Ballroom

    Download

    Download Project (498 KB)

    Description

    This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that allows us to describe the relationship between two vertices by placing an edge between them, and vertices without an edge between them are not related. A Hamiltonian cycle in a graph is a closed walk in the graph which visits each vertex exactly once. Given two graphs, G and H, a new graph, called the Cartesian product, can be created. This project will investigate what conditions on G and H are required for their Cartesian product graph to have a Hamilton cycle. Conversely, this project will investigate what conditions on G and H prevent their cartesian product graph from having a H-cycle.

    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

    Practical Wisdom; Scholarship; Vocation

    Hamiltonian Cycles and Cartesian Products

    Share

    COinS