Search Results for ""

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...

Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

The term "vesica piscis," meaning "fish bladder" in Latin, is used for the particular symmetric lens formed by the intersection of two equal circles whose centers are offset ...

Given an arbitrary planar quadrilateral, place a square outwardly on each side, and connect the centers of opposite squares. Then van Aubel's theorem states that the two ...

If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...

Let n be a positive nonsquare integer. Then Artin conjectured that the set S(n) of all primes for which n is a primitive root is infinite. Under the assumption of the ...

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...