Algebraic methods in graph theory

Author(s)Li, Weiqiang
Date Accessioned2016-04-26T12:08:21Z
Date Available2016-04-26T12:08:21Z
Publication Date2015
AbstractThe 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
AdvisorCioaba, Sebastian M.
DegreePh.D.
DepartmentUniversity of Delaware, Department of Mathematical Sciences
Unique Identifier947837861
URLhttp://udspace.udel.edu/handle/19716/17682
PublisherUniversity of Delawareen_US
URIhttp://search.proquest.com/docview/1734473830?accountid=10457
dc.subject.lcshGraph theory.
dc.subject.lcshAlgebra.
dc.subject.lcshGraph connectivity.
dc.subject.lcshBrouwer, A. E. -- (Andries Evert)
TitleAlgebraic methods in graph theoryen_US
TypeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2015_LiWeiqiang_PhD.pdf
Size:
835.17 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.22 KB
Format:
Item-specific license agreed upon to submission
Description: