In [ER van Dam, WH Haemers, Which graphs are determined by their spectrum? Linear
Algebra Appl. 373 (2003), 241–272] we gave a survey of answers to the question of which …

The lollipop graph, denoted by Hn, p, is obtained by appending a cycle Cp to a pendant
vertex of a path Pn-p. We will show that no two non-isomorphic lollipop graphs are …

Starlike trees are determined by their Laplacian spectrum Page 1 Linear Algebra and its
Applications 422 (2007) 654–658 www.elsevier.com/locate/laa Starlike trees are …

An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a
path with pendant vertex as distinguished vertex. It is known that the odd lollipop is …

As a discrete analogue of Kac's celebrated question on 'hearing the shape of a drum'and
towards a practical graph isomorphism test, it is of interest to understand which graphs are …

A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian
matrix Q, any graph having the same spectrum as G is isomorphic to G. The lollipop graph …

A multi-fan graph is a graph of the form [Formula: see text], where b is a universal vertex, and
[Formula: see text] is the disjoint union of paths [Formula: see text] for i= 1, 2,…, k. In …

Let Knm denote the graph obtained by attaching m pendent edges to a vertex of complete
graph Kn-m, and Un, p the graph obtained by attaching np pendent edges to a vertex of Cp …

Spectral characterization of graphs with index at most √ 2 + √ 5 Page 1 Linear Algebra and
its Applications 420 (2007) 483–489 www.elsevier.com/locate/laa Spectral characterization of …

Let M be an associated matrix of a graph G (the adjacency, Laplacian and signless
Laplacian matrix). Two graphs are said to be cospectral with respect to M if they have the …