Search Results for ""

The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...

The angular distance traveled around a circle is the number of radians the path subtends, theta=l/(2pir)2pi=l/r.

An approach for the calculation of a Gröbner basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of inequalities.

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

A homology class in a singular homology theory is represented by a finite linear combination of geometric subobjects with zero boundary. Such a linear combination is ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

Graph Strength