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]
References[]
- ^ M. Lepovic, I. Gutman (2001). No starlike trees are cospectral.
External links[]
- Weisstein, Eric W. "Spider Graph". MathWorld.
- (sequence A004250 in the OEIS)
 | This combinatorics-related article is a stub. You can help Wikipedia by . |
Categories:
- Trees (graph theory)
- Spectral theory
- Combinatorics stubs