Search Results for ""

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

A C^infty function is a function that is differentiable for all degrees of differentiation. For instance, f(x)=e^(2x) (left figure above) is C^infty because its nth ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...