Search Results for ""

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

A special case of a flag manifold. A Grassmann manifold is a certain collection of vector subspaces of a vector space. In particular, g_(n,k) is the Grassmann manifold of ...

A quantity a is said to be greater than b if a is larger than b, written a>b. If a is greater than or equal to b, the relationship is written a>=b. In the Wolfram Language, ...

When applied to a system possessing a length R at which solutions in a variable r change character (such as the gravitational field of a sphere as r runs from the interior to ...

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...

A G-space provides local notions of harmonic, hyperharmonic, and superharmonic functions. When there exists a nonconstant superharmonic function greater than 0, it is a ...

A method for predicting the onset of widespread chaos. It is based on the hypothesis that the dissolution of an invariant torus can be associated with the sudden change from ...