Search Results for ""

An h-cobordism is a bordism W between two manifolds M_1 and M_2 such that W is simply connected and the inclusion maps M_1->W and M_2->W are homotopy equivalences.

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

Let f(z) be a transcendental meromorphic function, and let D_1, D_2, ..., D_5 be five simply connected domains in C with disjoint closures (Ahlfors 1932). Then there exists j ...

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...