Honors Theses

Date of Award

2014

Document Type

Undergraduate Thesis

Department

Mathematics

First Advisor

William Staton

Relational Format

Dissertation/Thesis

Abstract

The independence polynomial of a graph is a polynomial whose coefficients number the independent sets of each size in that graph. This paper looks into methods of obtaining these polynomials for certain classes of graphs which prove too large to easily find the polynomial by traditional methods.

Accessibility Status

Searchable text

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.