Star (graph theory)
Star | ||
---|---|---|
Chromatic index k | | |
Properties | Edge-transitive Tree Unit distance Bipartite | |
Notation | Sk | |
Table of graphs and parameters |
In
A star with 3 edges is called a claw.
The star Sk is
Stars may also be described as the only connected graphs in which at most one vertex has degree greater than one.
Relation to other graph families
Claws are notable in the definition of
A star is a special kind of tree. As with any tree, stars may be encoded by a Prüfer sequence; the Prüfer sequence for a star K1,k consists of k − 1 copies of the center vertex.[4]
Several
Other applications
The set of distances between the vertices of a claw provides an example of a finite metric space that cannot be embedded isometrically into a Euclidean space of any dimension.[8]
The star network, a computer network modeled after the star graph, is important in distributed computing.
A geometric realization of the star graph, formed by identifying the edges with intervals of some fixed length, is used as a local model of curves in tropical geometry. A tropical curve is defined to be a metric space that is locally isomorphic to a star-shaped metric graph.
See also
- Star (simplicial complex)- a generalization of the concept of a star from a graph to an arbitrary simplicial complex.
References
- MR 1432221.
- MR 2187738.
- JSTOR 2371086.
- ISBN 1558607749.
- .
- .
- Bibcode:2003math......4466L