Laplacian graph eigenvectors
| Autor: | Russell Merris |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Degree matrix
Decomposable graph Kronecker product Spectrally unique graph Isospectral graphs Algebraic connectivity Combinatorics Discrete Mathematics and Combinatorics Adjacency matrix Graph spectra Mathematics Discrete mathematics Numerical Analysis Algebra and Number Theory Resistance distance Spectral graph theory Laplacian integral graph Neighbourhood (graph theory) Graph join Graph product Threshold graph Graph energy Fiedler vector Geometry and Topology 05C50 Faria vector Laplacian matrix |
| Zdroj: | Linear Algebra and its Applications. 278:221-236 |
| ISSN: | 0024-3795 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect