Search Results for ""

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

A 4-polyhex.

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

Two sets T_1 and T_2 are called Wilf equivalent if they belong to the same Wilf class.

A finite sequence of n letters from some alphabet is said to be an n-ary word.

One of the seven 4-polyhexes. S. Kim has observed that four worms solve the puzzle of finding a non-three-colorable map with only four congruent countries (as long as no ...

The 6-polyiamond illustrated above.

An even alternating permutation number, more commonly called a tangent number.