Search Results for ""

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...