Off-campus UNL users: To download campus access dissertations, please use the following link to log into our proxy server with your NU ID and password. When you are done browsing please remember to return to this page and log out.

Non-UNL users: Please talk to your librarian about requesting this dissertation through interlibrary loan.

Minimum independence number of graphs with specified degree sequences

Patricia Fay Nelson, University of Nebraska - Lincoln

Abstract

In this thesis we consider the lower bound on a graph's independence number in terms of the degree sequence of the graph. We present three functions of the degree sequence which are known lower bounds on independence number and compare them. We show that one of these functions, the residue, is often best possible. We determine explicitly the best possible lower bound on independence number of graphs realizing a given semi-regular degree sequence. ^

Subject Area

Mathematics

Recommended Citation

Nelson, Patricia Fay, "Minimum independence number of graphs with specified degree sequences" (2001). ETD collection for University of Nebraska - Lincoln. AAI3004618.
http://digitalcommons.unl.edu/dissertations/AAI3004618

Share

COinS