Search Results for ""

In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...