Starlike trees are determined by their Laplacian spectrum
By Gholam Reza Omidi, Khosro Tajbakhsh. 2007
95 citations recorded by the source corpus.
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.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Spectroscopy
View Paper: https://www.semanticscholar.org/paper/8f72ab8663097f8ab789d349f3035a3fca9b2901
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Slobodan K. Simic
- Dragos M. Cvetkovic
- Cheng-Xian Xu
- Wei Wang
- Vladimir Nikiforov
- Pierre Hansen
- Mustapha Aouchiche
- Matthew A. Masten
In Geometry and Topology
- Slobodan K. Simic
- Dragos M. Cvetkovic
- Cheng-Xian Xu
- Wei Wang
- Vladimir Nikiforov
- Pierre Hansen
- Mustapha Aouchiche
- Zoran Stanic
In Spectroscopy
Citations in the corpus
- Towards a spectral theory of graphs based on the signless Laplacian, I (2009, background): “Starlike trees are DS in the L–theory [37], while this is not proved for the A–theory [50].”
- Spectral characterizations of lollipop graphs (2008, unknown): “The following known results can be found in [2,3,7,8,11,12,13,14].”
- On the spectral characterization of T-shape trees (2006, background): “4 [2] [10] Let G be a graph.”