Search Results for ""

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

The inverse tangent is the multivalued function tan^(-1)z (Zwillinger 1995, p. 465), also denoted arctanz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 311; ...

A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...

Expanding the Riemann zeta function about z=1 gives zeta(z)=1/(z-1)+sum_(n=0)^infty((-1)^n)/(n!)gamma_n(z-1)^n (1) (Havil 2003, p. 118), where the constants ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...