Authors

Presenter(s)

Sarah Josephine Herr

Comments

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

Files

Download

Download Project (126 KB)

Description

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. The following is a project for MTH 466 - Graph Theory and Combinatorics. The Reconstruction Conjecture states that any unknown graph that has at least five vertices can be reconstructed from knowing the “deck” of all its induced subgraphs that have one vertex removed. We will explore the validity of this conjecture. We will also consider ways of determining that a given deck of graphs is either an incorrect set or not the full set of induced subgraphs of a fixed graph and therefore unusable in reconstruction.

Publication Date

4-22-2021

Project Designation

Course Project

Primary Advisor

Aparna W. Higgins

Primary Advisor's Department

Mathematics

Keywords

Stander Symposium Posters, College of Arts and Sciences

Reconstruction and Solvability

Share

COinS