On a Laplacian spectral characterization of graphs of index less than 2 (Q952064)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On a Laplacian spectral characterization of graphs of index less than 2
scientific article

    Statements

    On a Laplacian spectral characterization of graphs of index less than 2 (English)
    0 references
    6 November 2008
    0 references
    A graph is said to be determined by the adjacency (respectively, Laplacian) spectrum if there is no other non-isomorphic graph with the same adjacency (respectively, Laplacian) spectrum. The connected graphs with index less than \(2\) are known, and each is determined by its adjacency spectrum. It is shown that graphs of index less than \(2\) are determined by their Laplacian spectrum.
    0 references
    0 references
    spectra of graphs
    0 references
    cospectral graphs
    0 references
    Laplacian matrix
    0 references
    0 references
    0 references