Search Results for ""

A number theoretic function is a function whose domain is the set of positive integers.

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

The least number of crossings that occur in any projection of a link. In general, it is difficult to find the crossing number of a given link. Knots and links are generally ...

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