Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum (Q2484386): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.laa.2005.01.036 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2005.01.036 / rank
 
Normal rank

Latest revision as of 22:45, 18 December 2024

scientific article
Language Label Description Also known as
English
Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
scientific article

    Statements

    Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum (English)
    0 references
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    The paper studies the question: Can you hear the shape of certain trees? This means: Does the spectrum of the Laplacian (or the adjacency matrix) determine the graph up to graph isomorphism? It is shown that certain trees are determined by the adjacency or Laplacian spectrum.
    0 references
    adjacency spectrum
    0 references
    Laplacian spectrum
    0 references

    Identifiers