Search Results for ""

The "witch of Agnesi" is a curve studied by Maria Agnesi in 1748 in her book Instituzioni analitiche ad uso della gioventù italiana (the first surviving mathematical work ...

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

The classic treatise in geometry written by Euclid and used as a textbook for more than 1000 years in western Europe. An Arabic version The Elements appears at the end of the ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

The Galton board, also known as a quincunx or bean machine, is a device for statistical experiments named after English scientist Sir Francis Galton. It consists of an ...