Search Results for ""

Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

An n-component of a graph G is a maximal n-connected subgraph.

The cotree T^* of a spanning tree T in a connected graph G is the spacing subgraph of G containing exactly those edges of G which are not in T (Harary 1994, p. 39).

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A rewriting of a given quantity (e.g., a matrix) in terms of a combination of "simpler" quantities.

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M into disjoint pathwise-connected subsets. Then if F is a foliation of M, each F_alpha is called a leaf ...

Two closed simply connected 4-manifolds are homeomorphic iff they have the same bilinear form beta and the same Kirby-Siebenmann invariant kappa. Any beta can be realized by ...