Search Results for ""

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...

In plane geometry, a chord is the line segment joining two points on a curve. The term is often used to describe a line segment whose ends lie on a circle. The term is also ...

A 16-sided polygon, sometimes also called a hexakaidecagon. The regular hexadecagon is a constructible polygon, and the inradius r, circumradius R, and area A of the regular ...

The nonagon, also known as an enneagon, is a 9-sided polygon. Although the term "enneagon" is perhaps preferable (since it uses the Greek prefix and suffix instead of the ...

A triangular pyramid is a pyramid having a triangular base. The tetrahedron is a triangular pyramid having congruent equilateral triangles for each of its faces. The edge ...

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 ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...