Search Results for ""

The cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron. It is implemented in the Wolfram Language as ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

The equilateral elongated square dipyramid, illustrated above together with its net, is Johnson solid J_(15). A version of the elongated square dipyramid that is "squashed" ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

Let Omega be an open, bounded, and connected subset of R^d for some d and let dx denote d-dimensional Lebesgue measure on R^d. In functional analysis, the Friedrichs ...

The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...