Developments on spectral characterizations of graphs (Q1011495): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:22, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Developments on spectral characterizations of graphs |
scientific article |
Statements
Developments on spectral characterizations of graphs (English)
0 references
8 April 2009
0 references
In [\textit{E.R. van Dam} and \textit{W. H. Haemers}, ``Which graphs are determined by their spectrum?'', Linear Algebra Appl. 373, 241--272 (2003; Zbl 1026.05079)] is given a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency matrix and the Laplacian matrix were addressed. Furthermore, some research questions on this topic are formulated. In the meantime, some of these questions have been (partially) answered. In the present paper is given a survey of these and other developments.
0 references
spectra of graphs
0 references
cospectral graphs
0 references
generalized adjacency matrices
0 references
distance-regular graphs
0 references