Algebraic methods in graph theory

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.

Grantor dc:publisher

University of Delaware

Year dc:date.issued

2015

Author dc:creator

• Li, Weiqiang

DOI

https://doi.org/10.58088/a53t-cc68

OAI identifier oai:identifier

oai:udspace.udel.edu:19716/17682