TY - JOUR
T1 - Complete split graph determined by its (signless) Laplacian spectrum
AU - Das, Kinkar Ch
AU - Liu, Muhuo
N1 - Publisher Copyright:
© 2016 Elsevier B.V.
PY - 2016
Y1 - 2016
N2 - A complete split graph CS(n,α), is a graph on n vertices consisting of a clique on n−α vertices and an independent set on the remaining α(1≤α≤n−1) vertices in which each vertex of the clique is adjacent to each vertex of the independent set. In this paper, we prove that CS(n,α) is determined by its Laplacian spectrum when 1≤α≤n−1, and CS(n,α) is also determined by its signless Laplacian spectrum when 1≤α≤n−1 and α≠3.
AB - A complete split graph CS(n,α), is a graph on n vertices consisting of a clique on n−α vertices and an independent set on the remaining α(1≤α≤n−1) vertices in which each vertex of the clique is adjacent to each vertex of the independent set. In this paper, we prove that CS(n,α) is determined by its Laplacian spectrum when 1≤α≤n−1, and CS(n,α) is also determined by its signless Laplacian spectrum when 1≤α≤n−1 and α≠3.
KW - (Signless) Laplacian spectrum
KW - Complete split graph
KW - Determined by graph spectrum
UR - https://www.scopus.com/pages/publications/84956863782
U2 - 10.1016/j.dam.2016.01.003
DO - 10.1016/j.dam.2016.01.003
M3 - Article
AN - SCOPUS:84956863782
SN - 0166-218X
VL - 205
SP - 45
EP - 51
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -