Search Results for ""

The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...

A general type of statistical distribution which is related to the gamma distribution. Beta distributions have two free parameters, which are labeled according to one of two ...

Given two normal subgroups G_1 and G_2 of a group, and two normal subgroups H_1 and H_2 of G_1 and G_2 respectively, H_1(G_1 intersection H_2) is normal in H_1(G_1 ...

If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...