Kite graphs determined by their spectra

Kinkar Ch Das; Muhuo Liu

doi:10.1016/j.amc.2016.10.032

Kite graphs determined by their spectra

Kinkar Ch Das, Muhuo Liu

Department of Mathematics

South China Agricultural University

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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 Ki_n,n−1 is determined by its signless Laplacian spectrum when n ≠ 5 and n ≥ 4, and Ki_n,n−1 is also determined by its distance spectrum when n ≥ 4.

Original language	English
Pages (from-to)	74-78
Number of pages	5
Journal	Applied Mathematics and Computation
Volume	297
DOIs	https://doi.org/10.1016/j.amc.2016.10.032
State	Published - 15 Mar 2017

Keywords

(Signless) Laplacian spectrum
Distance spectrum
Kite graph

Access to Document

10.1016/j.amc.2016.10.032

Cite this

@article{021f8e45b66d4630b8e2642bfc298415,

title = "Kite graphs determined by their spectra",

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 = "(Signless) Laplacian spectrum, Distance spectrum, Kite graph",

author = "Das, \{Kinkar Ch\} and Muhuo Liu",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc.",

year = "2017",

month = mar,

day = "15",

doi = "10.1016/j.amc.2016.10.032",

language = "English",

volume = "297",

pages = "74--78",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Kite graphs determined by their spectra

AU - Das, Kinkar Ch

AU - Liu, Muhuo

PY - 2017/3/15

Y1 - 2017/3/15

N2 - 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.

AB - 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.

KW - (Signless) Laplacian spectrum

KW - Distance spectrum

KW - Kite graph

UR - https://www.scopus.com/pages/publications/85000577449

U2 - 10.1016/j.amc.2016.10.032

DO - 10.1016/j.amc.2016.10.032

M3 - Article

AN - SCOPUS:85000577449

SN - 0096-3003

VL - 297

SP - 74

EP - 78

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

Kite graphs determined by their spectra

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this