an Entity references as follows:
In graph theory, a star Sk is the complete bipartite graph K1,kâ: a tree with one internal node and k leaves (but no internal nodes and k + 1 leaves when k ⤠1). Alternatively, some authors define Sk to be the tree of order k with maximum diameter 2; in which case a star of k > 2 has k â 1 leaves. A star with 3 edges is called a claw. Stars may also be described as the only connected graphs in which at most one vertex has degree greater than one.