Search Results for ""

A strange loop is a phenomenon in which, whenever movement is made upwards or downwards through the levels of some hierarchical system, the system unexpectedly arrives back ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

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

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.