Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
Graph Centers, Hypergraph Degree Sequences, And Induced-Saturation, Sarah Lynne Behrens
Graph Centers, Hypergraph Degree Sequences, And Induced-Saturation, Sarah Lynne Behrens
Department of Mathematics: Dissertations, Theses, and Student Research
The center of a graph is the set of vertices whose distance to other vertices is minimal. The centralizing number of a graph G is the minimum number of additional vertices in any graph H where V(G) is the center of H. Buckley, Miller, and Slater and He and Liu provided infinite families of graphs with each centralizing number. We show the number of graphs with each nonzero centralizing number grows super-exponentially with the number of vertices. We also provide a method of altering graphs without changing the centralizing number and give results about the centralizing …
Extremal Results For The Number Of Matchings And Independent Sets, Lauren Keough
Extremal Results For The Number Of Matchings And Independent Sets, Lauren Keough
Department of Mathematics: Dissertations, Theses, and Student Research
This dissertation answers several questions in extremal graph theory, each concerning the maximum or minimum number of certain substructures a graph can have, given that it must satisfy certain properties. In recent years there has been increased interest in such problems, which are extremal problems for "counting" parameters of graphs. The results in this dissertation focus on graphs that have n vertices and e edges and 3-uniform hypergraphs that have n vertices and e edges.
We first observe in the preliminaries chapter that for graphs with a fixed number of vertices and edges there is a threshold graph attaining the …