Search Results for ""

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

The path of an object through phase space.

The Delta-variation is a variation in which the varied path over which an integral is evaluated may end at different times than the correct path, and there may be variation ...

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 ...

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 matching is a maximum matching iff it contains no augmenting path.

The shortest path-spanning tree from a graph vertex of a graph.

If del xF=0 (i.e., F(x) is an irrotational field) in a simply connected neighborhood U(x) of a point x, then in this neighborhood, F is the gradient of a scalar field phi(x), ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...