Back to Search
Start Over
Kite graphs determined by their spectra.
- Source :
-
Applied Mathematics & Computation . Mar2017, Vol. 297, p74-78. 5p. - Publication Year :
- 2017
-
Abstract
- A kite graph Ki n , ω is a graph obtained from a clique K ω and a path P n − ω by adding an edge between a vertex from the clique and an endpoint from the path. In this note, we prove that K i n , n − 1 is determined by its signless Laplacian spectrum when n ≠ 5 and n ≥ 4, and K i n , n − 1 is also determined by its distance spectrum when n ≥ 4. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 297
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 119847895
- Full Text :
- https://doi.org/10.1016/j.amc.2016.10.032