Search Results for ""

A pair (M,omega), where M is a manifold and omega is a symplectic form on M. The phase space R^(2n)=R^n×R^n is a symplectic manifold. Near every point on a symplectic ...

A topological partial algebra is a pair (A,tau), where A=(A,(f_i^A)_(i in I)) is a partial algebra and each of the operations f_i^A is continuous in the product topology. ...

The Dedekind psi-function is defined by the divisor product psi(n)=nproduct_(p|n)(1+1/p), (1) where the product is over the distinct prime factors of n, with the special case ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...