Search Results for ""

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

A pretzel graph is a graph with graph genus 3 (West 2000, p. 266). Planar, toroidal graphs, and double-toroidal graphs are therefore not pretzel. Examples of pretzel graphs ...

A divergenceless vector field, also called a solenoidal field, is a vector field for which del ·F=0. Therefore, there exists a G such that F=del xG. Furthermore, F can be ...

A divergenceless field can be partitioned into a toroidal and a poloidal part. This separation is important in geo- and heliophysics, and in particular in dynamo theory and ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...

The hyperbolic cotangent is defined as cothz=(e^z+e^(-z))/(e^z-e^(-z))=(e^(2z)+1)/(e^(2z)-1). (1) The notation cthz is sometimes also used (Gradshteyn and Ryzhik 2000, p. ...

A coordinate system similar to toroidal coordinates but with fourth-degree instead of second-degree surfaces for constant mu so that the toroids of circular cross section are ...