Search Results for ""

A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...

A commutative diagram is a collection of maps A_i-->^(phi_i)B_i in which all map compositions starting from the same set A and ending with the same set B give the same ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

The Pythagoras tree is a fractal constructed iteratively from a right triangle with squares erected on each of the sides. Subsequent iterations add additional similar right ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...