Search Results for ""

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

The golden gnomon is the obtuse isosceles triangle whose ratio of side to base lengths is given by 1/phi=phi-1, where phi is the golden ratio. Such a triangle has angles of ...

For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

A Greek cross, also called a square cross, is a cross in the shape of a plus sign. It is a non-regular dodecagon. A square cross appears on the flag of Switzerland, and also ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

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

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...