Search Results for ""

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

A matching is a maximum matching iff it contains no augmenting path.

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

The smallI icosicosidodecahedron is the uniform polyhedron with Maeder index 31 (Maeder 1997), Wenninger index 71 (Wenninger 1989), Coxeter index 40 (Coxeter et al. 1954), ...

A multiway system that generates causal networks which are all isomorphic as acyclic digraphs is said to exhibit causal invariance, and the causal network itself is also said ...

A submodule S of a module M such that for any proper submodule T of M, the submodule generated by S union T is not the entire module M. S is also called superfluous submodule.

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A flow line for a map on a vector field F is a path sigma(t) such that sigma^'(t)=F(sigma(t)).