graph theory In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conn ...

, a star is the

complete bipartite graph In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set..Electronic edition page 17. Graph theory i ...

tree In botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be narrower, including only woody plants with secondary growth, plants that are ...

with one internal node and leaves (but no internal nodes and leaves when ). Alternatively, some authors define to be the tree of order with maximum

diameter In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints lie on the circle. It can also be defined as the longest chord of the circle. Both definitions are also valid fo ...

2; in which case a star of has leaves. A star with 3 edges is called a claw. The star is edge-graceful when is even and not when is odd. It is an

edge-transitive In geometry, a polytope (for example, a polygon or a polyhedron) or a tiling is isotoxal () or edge-transitive if its symmetries act transitively on its edges. Informally, this means that there is only one type of edge to the object: given t ...

matchstick graph In geometric graph theory, a branch of mathematics, a matchstick graph is a Graph (discrete mathematics), graph that can be Graph drawing, drawn in the plane in such a way that its edges are line segments with length one that do not cross each ...

, and has diameter 2 (when ), girth ∞ (it has no cycles),

chromatic index In graph theory, an edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. For example, the figure to the right shows an edge coloring of a graph by the colors red, blu ...

, and

chromatic number In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices ...

2 (when ). Additionally, the star has large automorphism group, namely, the symmetric group on letters. 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

claw-free graph In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph ''K''1,3 (that is, a star graph comprising three edges, three leaves, ...

s, graphs that do not have any claw as an

induced subgraph In the mathematical field of graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and ''all'' of the edges (from the original graph) connecting pairs of vertices in that subset. Defini ...

. They are also one of the exceptional cases of the

Whitney graph isomorphism theorem In the mathematical discipline of graph theory, the line graph of an undirected graph is another graph that represents the adjacencies between edges of . is constructed in the following way: for each edge in , make a vertex in ; for every ...

: in general, graphs with isomorphic

line graph In the mathematical discipline of graph theory, the line graph of an undirected graph is another graph that represents the adjacencies between edges of . is constructed in the following way: for each edge in , make a vertex in ; for every ...

s are themselves isomorphic, with the exception of the claw and the triangle . A star is a special kind of

. As with any tree, stars may be encoded by a Prüfer sequence; the Prüfer sequence for a star consists of copies of the center vertex. Several graph invariants are defined in terms of stars. Star arboricity is the minimum number of forests that a graph can be partitioned into such that each tree in each forest is a star, and the star chromatic number of a graph is the minimum number of colors needed to color its vertices in such a way that every two color classes together form a subgraph in which all connected components are stars. The graphs of branchwidth 1 are exactly the graphs in which each connected component is a star.

Other applications

The set of distances between the vertices of a claw provides an example of a finite

metric space In mathematics, a metric space is a set together with a notion of '' distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general set ...

that cannot be embedded isometrically into a

Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidean ...

of any dimension. The star network, a

computer network A computer network is a set of computers sharing resources located on or provided by network nodes. The computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are ...

modeled after the star graph, is important in

distributed computing A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another from any system. Distributed computing is a field of computer sci ...

. 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 In mathematics, tropical geometry is the study of polynomials and their geometric properties when addition is replaced with minimization and multiplication is replaced with ordinary addition: : x \oplus y = \min\, : x \otimes y = x + y. So f ...

. A tropical curve is defined to be a metric space that is locally isomorphic to a star shaped metric graph.

References

{{reflist Trees (graph theory) Parametric families of graphs

Relation to other graph families

Other applications

See also

References