Bounds for the independence number of a graph

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 up...

Full description

Bibliographic Details
Main Author:	Willis, William
Format:	Others
Published:	VCU Scholars Compass 2011
Subjects:	independence number graph theory bound Physical Sciences and Mathematics
Online Access:	http://scholarscompass.vcu.edu/etd/2575 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=3574&context=etd

id	ndltd-vcu.edu-oai-scholarscompass.vcu.edu-etd-3574
record_format	oai_dc
spelling	ndltd-vcu.edu-oai-scholarscompass.vcu.edu-etd-35742017-03-17T08:26:19Z Bounds for the independence number of a graph Willis, William 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. 2011-08-17T07:00:00Z text application/pdf http://scholarscompass.vcu.edu/etd/2575 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=3574&context=etd © The Author Theses and Dissertations VCU Scholars Compass independence number graph theory bound Physical Sciences and Mathematics
collection	NDLTD
format	Others
sources	NDLTD
topic	independence number graph theory bound Physical Sciences and Mathematics
spellingShingle	independence number graph theory bound Physical Sciences and Mathematics Willis, William Bounds for the independence number of a graph
description	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.
author	Willis, William
author_facet	Willis, William
author_sort	Willis, William
title	Bounds for the independence number of a graph
title_short	Bounds for the independence number of a graph
title_full	Bounds for the independence number of a graph
title_fullStr	Bounds for the independence number of a graph
title_full_unstemmed	Bounds for the independence number of a graph
title_sort	bounds for the independence number of a graph
publisher	VCU Scholars Compass
publishDate	2011
url	http://scholarscompass.vcu.edu/etd/2575 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=3574&context=etd
work_keys_str_mv	AT williswilliam boundsfortheindependencenumberofagraph
_version_	1718427807910985728

Bounds for the independence number of a graph

Similar Items