id: 01354780
dt: j
an: 01354780
au: Merris, Russell
ti: Laplacian graph eigenvectors.
so: Linear Algebra Appl. 278, No.1-3, 221-236 (1998).
py: 1998
pu: Elsevier Science Inc. (North-Holland), New York, NY
la: EN
cc: 
ut: connectivity; decomposable graph; Kronecker product; integral graph;
    threshold graph; Laplacian matrix; Laplacian eigenvector; isospectral
    graphs; degree sequences
ci: 
li: doi:10.1016/S0024-3795(97)10080-5
ab: Summary: 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 artilce 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.
rv: