Search Results for ""

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

The hexagram is the star polygon {6/2}, also known as the star of David or Solomon's seal, illustrated at left above. It appears as one of the clues in the novel The Da Vinci ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

A hyperboloid is a quadratic surface which may be one- or two-sheeted. The one-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...