Search Results for ""

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...

A map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...

A connex is a geometric form introduced by Clebsch (1872) that included as special cases the curve considered as a point locus and the curve considered as a line envelope ...

An additive group is a group where the operation is called addition and is denoted +. In an additive group, the identity element is called zero, and the inverse of the ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A derivative of a complex function, which must satisfy the Cauchy-Riemann equations in order to be complex differentiable.

The second-order ordinary differential equation (x^2y^')^'+x^2y^n=0.

The third-order ordinary differential equation y^(''')+alphayy^('')+beta(1-y^('2))=0.

If F is a group, then the extensions G of F of order o with G/phi(G)=F, where phi(G) is the Frattini subgroup, are called Frattini extensions.