In this first talk we will introduce three of the most commonly used types of matrices in spectral graph theory. They are the adjacency matrix, the combinatorial Laplacian, and the normalized Laplacian. We also will give some simple examples of how the spectrum can be used for each of these types.
%0 Unpublished Work
%1 butler2006-1
%A Butler, Steve
%D 2006
%K graph introduction spectral theory
%T Spectral Graph Theory: Three common spectra
@unpublished{butler2006-1,
added-at = {2009-03-06T15:19:16.000+0100},
author = {Butler, Steve},
biburl = {https://www.bibsonomy.org/bibtex/2ed2937203a56179d580680c7bdf9fd9a/folke},
description = {In this first talk we will introduce three of the most commonly used types of matrices in spectral graph theory. They are the adjacency matrix, the combinatorial Laplacian, and the normalized Laplacian. We also will give some simple examples of how the spectrum can be used for each of these types.},
interhash = {115d301ff774f0b990c66b354c06f139},
intrahash = {ed2937203a56179d580680c7bdf9fd9a},
keywords = {graph introduction spectral theory},
timestamp = {2009-03-06T15:19:16.000+0100},
title = {Spectral Graph Theory: Three common spectra},
year = 2006
}