MSpace - DSpace at UofM >
Faculty of Graduate Studies (Electronic Theses and Dissertations) >
FGS - Electronic Theses & Dissertations (Public) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1993/2048

Title: The Laplacian spectrum of graphs
Authors: Newman, Michael William
Issue Date: 1-Jul-2001
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.
URI: http://hdl.handle.net/1993/2048
Appears in Collection(s):FGS - Electronic Theses & Dissertations (Public)

Files in This Item:

File Description SizeFormat
MQ57564.pdf5.9 MBAdobe PDFView/Open
View Statistics

Items in MSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! MSpace Software Copyright © 2002-2010  Duraspace - Feedback