Back to Search
Start Over
Graphs cospectral with starlike trees
- Source :
-
Linear Algebra & its Applications . Dec2008, Vol. 429 Issue 11/12, p2691-2701. 11p. - Publication Year :
- 2008
-
Abstract
- Abstract: A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called -cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral mates for some starlike trees. We also present a set of necessary and sufficient conditions for divisibility of the characteristic polynomial of a starlike tree by the characteristic polynomial of a path. [Copyright &y& Elsevier]
- Subjects :
- *PAPER
*FIBERS
*WRITING materials & instruments
*ART materials
*PAPER arts
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 429
- Issue :
- 11/12
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 34581485
- Full Text :
- https://doi.org/10.1016/j.laa.2008.01.001