Search Results for ""

A statement letter or a negation of a statement letter (Mendelson 1997, p. 30).

A roll of 4 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a little Joe" is 1/12, or 8.333...%. A roll of "4 the hard ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The conjecture that the maximum local density is given by rho_(dodecahedron).

A graph for which every node has finite degree.

For all integers n and |x|<a, lambda_n^((t))(x+a)=sum_(k=0)^infty|_n; k]lambda_(n-k)^((t))(a)x^k, where lambda_n^((t)) is the harmonic logarithm and |_n; k] is a Roman ...

One of the Eilenberg-Steenrod axioms. It states that, for every pair (X,A), there is a natural long exact sequence ...->H_n(A)->H_n(X)->H_n(X,A)->H_(n-1)(A)->..., where the ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...