Presenter(s)

Preston Reed Boorsma

Comments

This poster reflects research conducted as part of a course project designed to give students experience in the research process.

Download

Download Project (494 KB)

Description

This is a project for 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. Two graphs are said to be isomorphic if they have the same structure; their vertices can be relabeled and arranged so that the graphs look identical. This project investigates measures for determining how “close” two non-isomorphic graphs are to being isomorphic. We will explore questions such as whether two graphs can have a unique greatest common subgraph.

Publication Date

4-24-2019

Project Designation

Course Project

Primary Advisor

Aparna W. Higgins

Primary Advisor's Department

Mathematics

Keywords

Stander Symposium project

Distance Between Graphs

Share

COinS