Search Results for ""

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. It is sometimes known as the ...

A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

A centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...