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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2005.01.036 / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Ling Shen / rank
Normal rank
 
Property / author
 
Property / author: Yao-Ping Hou / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q801367 / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Ling Shen / rank
 
Normal rank
Property / author
 
Property / author: Yao-Ping Hou / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Audrey A. Terras / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2005.01.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012025710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complement of the path is determined by its spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: No starlike trees are cospectral / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864537 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2005.01.036 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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