Search Results for ""

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...

A pair of numbers m and n such that sigma(m)=sigma(n)=m+n-1, where sigma(m) is the divisor function. Beck and Najar (1977) found 11 augmented amicable pairs.

If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...