Show simple item record

dc.contributor.author Newman, Michael William en_US
dc.date.accessioned 2007-05-22T15:14:23Z
dc.date.available 2007-05-22T15:14:23Z
dc.date.issued 2001-07-01T00:00:00Z en_US
dc.identifier.uri http://hdl.handle.net/1993/2048
dc.description.abstract In this thesis we investigate the spectrum of the Laplacian matrix of a graph. Although its use dates back to Kirchhoff, most of the major results are much more recent. It is seen to reflect in a very natural way the structure of the graph, particularly those aspects related to connectedness. This can be intuitively understood as a consequence of the relationship between the Laplacian matrix and the boundary of a set of vertices in the graph. We investigate the relationship between the spectrum and the isoperimetric constant, expansion properties, and diameter of the graph. We consider the problem of integral spectra, and see how the structure of the eigenvectors can be used to deduce more information on both the spectrum and the graph, particularly for trees. In closing, we mention some alternatives to and generalisations of the Laplacian. en_US
dc.format.extent 6041297 bytes
dc.format.extent 184 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.language en en_US
dc.language.iso en_US
dc.title The Laplacian spectrum of graphs en_US
dc.degree.discipline Mathematics en_US
dc.degree.level Master of Science (M.Sc.) en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics