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 graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...

Cubic nonhamiltonian graphs are nonhamiltonian graphs that are also cubic. The numbers of connected cubic nonhamiltonian graphs on n=10, 12, ... nodes are 2, 5, 35, 219, ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

The Latin prefix quadri- is used to indicate the number 4, for example, quadrilateral, quadrant, etc. However, it also very commonly used to denote objects involving the ...

Given a nonhomogeneous ordinary differential equation, select a differential operator which will annihilate the right side, and apply it to both sides. Find the solution to ...

The substitution of x=w-p/(3w) (1) into the standard form cubic equation x^3+px=q. (2) The result reduces the cubic to the equation w^3-(p^3)/(27w^3)-q=0, (3) which is easily ...

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

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...