Detailed Information
Cited 10 time in 
Cited 8 time in 
Cited 8 time in
Metadata Downloads
Kite graphs determined by their spectra
- Issue Date
- 15-Mar-2017
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Kite graph; (Signless) Laplacian spectrum; Distance spectrum
- Citation
- APPLIED MATHEMATICS AND COMPUTATION, v.297, pp.74 - 78
- Indexed
- SCIE
SCOPUS
- Journal Title
- APPLIED MATHEMATICS AND COMPUTATION
- Volume
- 297
- Start Page
- 74
- End Page
- 78
- ISSN
- 0096-3003
- Abstract
- A kite graph Ki(n,omega) is a graph obtained from a clique K-omega and a path Pn-omega by adding an edge between a vertex from the clique and an endpoint from the path. In this note, we prove that Ki(n,n-1) is determined by its signless Laplacian spectrum when n not equal 5 and n >= 4, and Ki(n,n-1) is also determined by its distance spectrum when n >= 4. (C) 2016 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- KINKAR, CHANDRA DAS
- Science (Mathematics)