Search Results for ""

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

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.

Given a Euclidean n-space, H_n=n+1.

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.