Kite graphs determined by their spectra

详细信息    查看全文

• 作者：Kinkar Ch. Das ; ^a ; ^{kinkardas2003@googlemail.com} ; ^{kinkar@lycos.com} ; Muhuo Liu^b ; ^{liumuhuo@163.com}
• 关键词：Kite graph ; (Signless) Laplacian spectrum ; Distance spectrum
• 刊名：Applied Mathematics and Computation
• 出版年：2017
• 出版时间：15 March 2017
• 年：2017
• 卷：297
• 期：Complete
• 页码：74-78
• 全文大小：314 K
• 卷排序：297

文摘

A kite graph Kin, ω is a graph obtained from a clique Kω   and a path Pn−ω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.