A study of graph spectra for comparing graphs and trees

9 years 10 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a graph representation for pattern matching since it is invariant to the labelling of the graph. There are however a number of potential drawbacks in using the spectrum as a representation of a graph; Firstly, more than one graph may share the same spectrum. It is well known, for example, that very few trees can be uniquely specified by their spectrum. Secondly, the spectrum may change dramatically with a small change structure. There are a wide variety of graph matrix representations from which the spectrum can be extracted. Among these are the adjacency matrix, combinatorial Laplacian, normalised Laplacian and unsigned Laplacian. Spectra can also be derived from the heat kernel matrix and path length distribution matrix. The choice of matrix representation clearly has a large effect on the suitability of spect...
Richard C. Wilson, Ping Zhu
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where PR
Authors Richard C. Wilson, Ping Zhu
Comments (0)