Back to Search
Start Over
The spectral characterization of -graphs
- Source :
-
Linear Algebra & its Applications . Oct2012, Vol. 437 Issue 7, p1482-1502. 21p. - Publication Year :
- 2012
-
Abstract
- Abstract: A -graph is a graph consisting of two cycles and with just a vertex in common. Fan and Luo in Theorem 4.4 alleged that a -graph is determined by its adjacency spectrum if it contains no cycle . However, according to Theorem 6.3 we find that the result in Theorem 4.4 is not completely correct. In this paper, we prove that is DAS if and only if , and has a unique cospectral mate if . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 437
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 77788991
- Full Text :
- https://doi.org/10.1016/j.laa.2012.04.013