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: It immediately sublimates.
gollark: It immediately melts.
gollark: I wonder if the presumably extant ARM CPUs in the controller of my SSD outperform your Pentium 3.
gollark: Oh, we just implemented Rust in a Turing machine built on quirks of the Linux virtual filesystem.
gollark: Yes.

References
  1. M. Lepovic, I. Gutman (2001). No starlike trees are cospectral.
  • Weisstein, Eric W. "Spider Graph". MathWorld.
  • (sequence A004250 in the OEIS)


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.