Search Results for ""

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

There are a number of mathematical curves that produced heart shapes, some of which are illustrated above. A "zeroth" curve is a rotated cardioid (whose name means ...

A second-order linear Hermitian operator is an operator L^~ that satisfies int_a^bv^_L^~udx=int_a^buL^~v^_dx. (1) where z^_ denotes a complex conjugate. As shown in ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

An invertible knot is a knot that can be deformed via an ambient isotopy into itself but with the orientation reversed. A knot that is not invertible is said to be ...