Starlike tree
In the area of mathematics known as graph theory, a tree is said to be starlike if it has exactly one vertex of degree greater than 2. This high-degree vertex is the root and a starlike tree is obtained by attaching at least three linear graphs to this central vertex.
Properties
Two finite starlike trees are isospectral, i.e. their graph Laplacians have the same spectra, if and only if they are isomorphic.[1]
gollark: If you can get them to die in <5h then it'll be great for getting rid of cave eggs.
gollark: Free for a CB ND?
gollark: Bad Idea #82995: Mageia Xenowyrm BSA to teleport all eggs from the AP to random scrolls.
gollark: Bad idea #929284818: GoN BSA to earthquake the AP.
gollark: I hope we'll reach ER soon.
References
- M. Lepovic, I. Gutman (2001). No starlike trees are cospectral.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.