The Gathering Number of a Graph and Vertex Degrees

John Bazaar

We discuss the motivation behind the definition of the gathering number, and we provide conditions on the degree sequence of G which imply g(G) ≥ k for a fixed integer k, with −|V (G)| ≤ k ≤ |V (G)|. We also indicate specifically how these degree conditions are best possible.

Major: 
Biology
Exhibition Category: 
Physical Sciences
Exhibition Format: 
Poster Presentation
Campus: 
University Park
Faculty Sponsor: 
Michael Yatauro
Poster Number: 
52979