Eigenvalues of graphs

Date
1970
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this work I study the relation between the geometric properties of a graph G and the eigenvalues of its adjacency matrix A(G). We show that it is possible to make use of "the spectral theory of graphs" in order to identify certain properties of a graph. For example from the eigenvalues of G we are able to decide whether or not G is regular, bipartite, without triangles.
Description
Bibliography: p. 55-56.
Keywords
Citation
Nosal, E. (1970). Eigenvalues of graphs (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/21350
Collections