Jump to content

Starlike tree

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GünniX (talk | contribs) at 16:47, 8 August 2020 (v2.03 - WP:WCW project (Reference list missing)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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


Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Starlike_tree&oldid=971851537"