𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Starlike trees are determined by their Laplacian spectrum

✍ Scribed by G.R. Omidi; K. Tajbakhsh

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
103 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we show that if G is a starlike tree, then it is determined by its Laplacian spectrum. Moreover we prove some facts about trees with the same adjacency spectrum as a starlike tree.

πŸ“œ SIMILAR VOLUMES

One special double starlike graph is det
One special double starlike graph is determined by its Laplacian spectrum
✍ Xiaogang Liu; Yuanping Zhang; Pengli Lu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 394 KB

A tree is called double starlike if it has exactly two vertices of degree greater than 2. We denote by H n (p, p) (n β‰₯ 2, p β‰₯ 1) one special double starlike graph. In this work, graph H n (p, p) will be proved to be determined by its Laplacian spectrum.

On some forests determined by their Lapl
On some forests determined by their Laplacian or signless Laplacian spectrum
✍ Slobodan K. SimiΔ‡; Zoran StaniΔ‡ πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 571 KB

The largest eigenvalues a b s t r a c t We consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs. We classify the graphs from the considered class into those which are determined, or not determined, by Lap

Which graphs are determined by their spe
Which graphs are determined by their spectrum?
✍ Edwin R. van Dam; Willem H. Haemers πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 242 KB

For almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered.