Search Results for ""

In mathematics, a formula is a fact, rule, or principle that is expressed in terms of mathematical symbols. Examples of formulas include equations, equalities, identities, ...

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...

The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The golden angle is the angle that divides a full angle in a golden ratio (but measured in the opposite direction so that it measures less than 180 degrees), i.e., GA = ...

Googolplex is a large number equal to 10^(10^(100)) (i.e., 1 with a googol number of 0s written after it). The term was coined in 1938 after 9-year-old Milton Sirotta, nephew ...

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...