Search Results for ""

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

A fixed point of a linear transformation for which the rescaled variables satisfy (delta-alpha)^2+4betagamma=0.

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

f_p=f_0+1/2p(p+1)delta_(1/2)-1/2(p-1)pdelta_(-1/2) +(S_3+S_4)delta_(1/2)^3+(S_3-S_4)delta_(-1/2)^3+..., (1) for p in [-1/2,1/2], where delta is the central difference and ...

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...

Two points are antipodal (i.e., each is the antipode of the other) if they are diametrically opposite. Examples include endpoints of a line segment, or poles of a sphere. ...

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

The first Brocard Cevian triangle is the Cevian triangle of the first Brocard point. It has area Delta_1=(2a^2b^2c^2)/((a^2+b^2)(b^2+c^2)(c^2+a^2))Delta, where Delta is the ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...