Search Results for ""

A singular integral is an integral whose integrand reaches an infinite value at one or more points in the domain of integration. Even so, such integrals can converge, in ...

The tritetrahedral graph is the skeleton of the tritetrahedron, a concave polyhedron formed by joining three regular tetrahedra at their faces. The Nechushtan graph, a ...

The tritetrahedron, also called the "boat polyhedron," is the name given in this work to the concave (non-regular) octahedron formed by joining three regular tetrahedra ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

A hyperbola (plural "hyperbolas"; Gray 1997, p. 45) is a conic section defined as the locus of all points P in the plane the difference of whose distances r_1=F_1P and ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...