Search Results for ""

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

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The expression im kleinen is German and means "on a small scale." A topological space is connected im kleinen at a point x if every neighborhood U of x contains an open ...

A topological space X is semilocally simply connected (also called semilocally 1-connected) if every point x in X has a neighborhood U such that any loop L:[0,1]->U with ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

Every compact 3-manifold is the connected sum of a unique collection of prime 3-manifolds.

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

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

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.