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

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

A right strophoid is the strophoid of a line L with pole O not on L and fixed point O^' being the point where the perpendicular from O to L cuts L is called a right ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

A ruled surface is a surface that can be swept out by moving a line in space. It therefore has a parameterization of the form x(u,v)=b(u)+vdelta(u), (1) where b is called the ...

A subset E of a topological space S is said to be of second category in S if E cannot be written as the countable union of subsets which are nowhere dense in S, i.e., if ...