Search Results for ""

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

The mittenpunkt (also called the middlespoint) of a triangle DeltaABC is the symmedian point of the excentral triangle, i.e., the point of concurrence M of the lines from the ...

Amazingly, the distribution of a sum of two normally distributed independent variates X and Y with means and variances (mu_x,sigma_x^2) and (mu_y,sigma_y^2), respectively is ...

A beautiful general theorem of which the following two statements are special cases (Coxeter and Greitzer 1967, pp. 99-100). 1. If DeltaABC and DeltaA^'B^'C^' are two ...

In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

The general sextic equation x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 can be solved in terms of Kampé de Fériet functions, and a restricted class of sextics can be solved in ...

The silver constant is the algebraic number given by S = (x^3-5x^2+6x-1)_3 (1) = 2+2cos(2/7pi) (2) = 3.246979603... (3) (OEIS A116425), where (P(x))_n denotes a polynomial ...