We will study various quantities related to connectivity of a graph. To this end, we look at Nordhaus-Gaddum type problems, which are problems where the same quantity is studied for a graph $G$ and its complement $G^c$ at the same time. For a graph $G$ on $n$ vertices with normalized Laplacian eigenvalues $0 = \lambda_1(G) \leq \lambda_2(G) \leq \cdots \leq \lambda_n(G)$ and graph complement $G^c$, we prove that \begin{equation*} \max\{\lambda_2(G),\lambda_2(G^c)\}\geq \frac{2}{n^2}. \end{equation*} We do this by way of lower bounding $\max\{i(G), i(G^c)\}$ and $\max\{h(G), h(G^c)\}$ where $i(G)$ and $h(G)$ denote the isoperimetric number and Cheeger constant of $G$, respectively. We also discuss some related Nordhaus-Gaddum questions.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-11451 |
| Date | 21 June 2024 |
| Creators | Knudson, Adam Widtsoe |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | https://lib.byu.edu/about/copyright/ |
Page generated in 0.0022 seconds