Search Results for ""

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

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.

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 ...

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

An odd alternating permutation number, more commonly called an Euler number or secant number.