Search Results for ""

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

A ternary tree is a tree-like structure that is rooted and in which each vertex has at most three children.

A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.

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

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).