The independence number of a graph is the maximum number of vertices from the vertex set of the graph such that no two vertices are adjacent. We systematically examine a collection of upper bounds for the independence number to determine graphs for which each upper bound is better than any other upper bound considered. A similar investigation follows for lower bounds. In several instances a graph cannot be found. We also include graphs for which no bound equals $\alpha$ and bounds which do not apply to general graphs.
| Identifer | oai:union.ndltd.org:vcu.edu/oai:scholarscompass.vcu.edu:etd-3574 |
| Date | 17 August 2011 |
| Creators | Willis, William |
| Publisher | VCU Scholars Compass |
| Source Sets | Virginia Commonwealth University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | © The Author |
Page generated in 0.0027 seconds