Search Results for ""

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.

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A set of identities involving n-dimensional visible lattice points was discovered by Campbell (1994). Examples include product_((a,b)=1; ...

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 patterns T_1 and T_2 belong to the same Wilf class if |S_n(T_1)|=|S_n(T_2)| for all n, where S_n(T) denotes the set of permutations on {1,...,n} that avoid the pattern T. ...

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.

The 6-polyiamond illustrated above.