Search Results for ""

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

Discrete Mathematics

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

Calabi-Yau spaces are important in string theory, where one model posits the geometry of the universe to consist of a ten-dimensional space of the form M×V, where M is a four ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...