Search Results for ""

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

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

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

An algebraic surface of degree 9. Enneper's minimal surface is an example of a nonic surface.

In the American system, 10^(30).

A function f(x) is said to be nonincreasing on an interval I if f(b)<=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nondecreasing on an interval ...

The term "nonisomorphic" means "not having the same form" and is used in many branches of mathematics to identify mathematical objects which are structurally distinct. ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

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

A quantity which is either 0 (zero) or positive, i.e., >=0.