Algebraic methods in graph theory
Author(s) | Li, Weiqiang | |
Date Accessioned | 2016-04-26T12:08:21Z | |
Date Available | 2016-04-26T12:08:21Z | |
Publication Date | 2015 | |
Abstract | The algebraic methods have been very successful in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of strongly regular graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs. | en_US |
Advisor | Cioaba, Sebastian M. | |
Degree | Ph.D. | |
Department | University of Delaware, Department of Mathematical Sciences | |
Unique Identifier | 947837861 | |
URL | http://udspace.udel.edu/handle/19716/17682 | |
Publisher | University of Delaware | en_US |
URI | http://search.proquest.com/docview/1734473830?accountid=10457 | |
dc.subject.lcsh | Graph theory. | |
dc.subject.lcsh | Algebra. | |
dc.subject.lcsh | Graph connectivity. | |
dc.subject.lcsh | Brouwer, A. E. -- (Andries Evert) | |
Title | Algebraic methods in graph theory | en_US |
Type | Thesis | en_US |