Kite graphs determined by their spectra

Kinkar Ch. Das and Muhuo Liu

Applied Mathematics and Computation, 2017, vol. 297, issue C, 74-78

Abstract: A kite graph Kin, ω is a graph obtained from a clique Kω and a path Pn−ω by adding an edge between a vertex from the clique and an endpoint from the path. In this note, we prove that Kin,n−1 is determined by its signless Laplacian spectrum when n ≠ 5 and n ≥ 4, and Kin,n−1 is also determined by its distance spectrum when n ≥ 4.

Keywords: Kite graph; (Signless) Laplacian spectrum; Distance spectrum (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316306397
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:297:y:2017:i:c:p:74-78

DOI: 10.1016/j.amc.2016.10.032

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().