Developments on Spectral Characterizations of Graphs
Developments on Spectral Characterizations of Graphs
复制标题
DOI：
10.2139/ssrn.994775
复制
发表时间：
2007-05
期刊：
影响因子：
--
通讯作者：
E. V. Dam;W. Haemers
中科院分区：
文献类型：
--
作者：
E. V. Dam;W. Haemers
在[E.R.van Dam，W.H.Haemers]中，哪些图是由它们的谱决定的？线性代数应用。373(2003)，241-272]我们给出了关于哪些图是由与图相关的某个矩阵的谱决定的问题的回答。特别地，讨论了常用的邻接矩阵和拉普拉斯矩阵。此外，我们还制定了一些关于这一主题的研究问题。与此同时，其中一些问题已经(部分)得到了回答。在这篇文章中，我们给出了这些和其他进展的综述。
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. 373 (2003), 241-272] we gave 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, we formulated some research questions on the topic. In the meantime, some of these questions have been (partially) answered. In the present paper we give a survey of these and other developments.