Search Results for ""

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

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

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...

A quasiregular polyhedron is the solid region interior to two dual regular polyhedra with Schläfli symbols {p,q} and {q,p}. Quasiregular polyhedra are denoted using a ...

The quasirhombicosidodecahedron is the uniform polyhedron with Maeder index 67 (Maeder 1997), Wenninger index 105 (Wenninger 1989), Coxeter index 84 (Coxeter et al. 1954), ...

The quasirhombicuboctahedron is the name given by Wenninger (1989, p. 132) to the uniform polyhedron with Maeder index 17 (Maeder 1997), Wenninger index 85 (Wenninger 1989), ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

The radical lines of three circles are concurrent in a point known as the radical center (also called the power center). This theorem was originally demonstrated by Monge ...

There are two awards that each go by the name "Ramanujan Prize": the SASTRA Ramanujan Prize and the ICTP Ramanujan Prize for Young Mathematicians from Developing Countries. ...