Search Results for ""

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

Bipolar coordinates are a two-dimensional system of coordinates. There are two commonly defined types of bipolar coordinates, the first of which is defined by x = ...

A set of curvilinear coordinates defined by x = (asinhv)/(coshv-cosu) (1) y = (asinu)/(coshv-cosu) (2) z = z, (3) where u in [0,2pi), v in (-infty,infty), and z in ...

The image of A_5×A_5 in the special orthogonal group SO(4), where A_5 is the icosahedral group.

Two slant triangular prisms fused together.

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...

The term "biquadratic equation" is sometimes used to as a synonym for quartic equation (Beyer 1987b, p. 34), but perhaps more commonly (e.g., Hazewinkel 1988; Gellert et al. ...