Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum (Q2484386): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 02:45, 20 March 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
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
