Loading...
Please wait, while we are loading the content...
Laplacian graph eigenvectors
| Content Provider | Semantic Scholar |
|---|---|
| Author | Russell Merris |
| Copyright Year | 2003 |
| Abstract | If G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. The main thrust of the present article is to prove several Laplacian eigenvector “principles” which in certain cases can be used to deduce the effect on the spectrum of contracting, adding or deleting edges and/or of coalescing vertices. One application is the construction of two isospectral graphs on 11 vertices having different degree sequences, only one of which is bipartite, and only one of which is decomposable. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.math.ucdavis.edu/~saito/data/graphlap/merris-graphlap-eigvecs.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Adjacency matrix Contract agreement Degree (graph theory) Graph - visual representation Spectral graph theory Thrust Vertex (geometry) |
| Content Type | Text |
| Resource Type | Article |