Search Results for ""

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

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

A 15-sided polygon, sometimes also called the pentakaidecagon. For a regular pentadecagon with side length 1, the inradius r, circumradius R, and area A are r = ...

A 30-sided polygon. The regular triacontagon with side length 1 has inradius r, circumradius R, and area A given by r = 1/4(sqrt(15)+3sqrt(3)+sqrt(2)sqrt(25+11sqrt(5))) (1) R ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...