Search Results for ""

Let phi_0 be the latitude for the origin of the Cartesian coordinates and lambda_0 its longitude, and let phi_1 and phi_2 be the standard parallels. Then for a unit sphere, ...

The Gall orthographic projection is a cylindrical equal-area projection with standard parallel of 45 degrees.

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...

The homotopy groups generalize the fundamental group to maps from higher dimensional spheres, instead of from the circle. The nth homotopy group of a topological space X is ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...