Search Results for ""

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

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 Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

Kepler's equation gives the relation between the polar coordinates of a celestial body (such as a planet) and the time elapsed from a given initial point. Kepler's equation ...

A square root of x is a number r such that r^2=x. When written in the form x^(1/2) or especially sqrt(x), the square root of x may also be called the radical or surd. The ...