Search Results for ""
341 - 350 of 537 for Growing Degree DaysSearch Results
A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...
A triangle cubic is a curve that can be expressed in trilinear coordinates such that the highest degree term in the trilinears alpha, beta, and gamma is of order three. Wells ...
A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...
A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...
Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...
For a second-order ordinary differential equation, y^('')+p(x)y^'+q(x)y=g(x). (1) Assume that linearly independent solutions y_1(x) and y_2(x) are known to the homogeneous ...
The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...
A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...
The Yff hyperbola is the hyperbola given parametrically by (1) The trilinear equation is complicated expression with coefficients up to degree 10 in the side lengths. This ...
A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...
...


