Search Results for ""

A matching is a maximum matching iff it contains no augmenting path.

The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The Cesàro means of a function f are the arithmetic means sigma_n=1/n(s_0+...+s_(n-1)), (1) n=1, 2, ..., where the addend s_k is the kth partial sum ...

A constructive proof is a proof that directly provides a specific example, or which gives an algorithm for producing an example. Constructive proofs are also called ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...