Search Results for ""

The number of empty neighbors of a cluster.

The order of the polynomial defining an algebraic curve.

The point of coincidence of P and P^' in Fagnano's theorem.

A polynomial function of the elements of a vector x can be uniquely decomposed into a sum of harmonic polynomials times powers of |x|.

The vertical length of an object from top to bottom.

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

Related to one another by a homomorphism.

J_(nualphabeta)^mu=J_(nubetaalpha)^mu=1/2(R_(alphanubeta)^mu+R_(betanualpha)^mu), where R is the Riemann tensor.

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...