Search Results for ""

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

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

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

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory. In general, ...

The following conditions are equivalent for a conservative vector field on a particular domain D: 1. For any oriented simple closed curve C, the line integral ∮_CF·ds=0. 2. ...

The cubeplex graph is the cubic Hamiltonian graph on 12 nodes illustrated above in several embeddings and corresponding to the graph Gamma_1 in Fischer and Little (2001). It ...