Search Results for ""

Given a function f(x) plotted in the Cartesian plane as y=f(x), the average rate of change (or average rate of change function) of f from x to a is given by ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

A node which is one graph edge further away from a given node in a rooted tree.

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closed if for any sequence of vectors v_n in D(A) such that v_n->v and Av_n->x as n->infty, it ...

The collapsoids are a class of non-convex collapsible polyhedra. They can be constructed by replacing each edge of a dodecahedron or icosahedron by the diagonal of a pyramid ...

Let L be a link in R^3 and let there be a disk D in the link complement R^3-L. Then a surface F such that D intersects F exactly in its boundary and its boundary does not ...

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...