Search Results for ""

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

The Weierstrass zeta function zeta(z;g_2,g_3) is the quasiperiodic function defined by (dzeta(z;g_2,g_3))/(dz)=-P(z;g_2,g_3), (1) where P(z;g_2,g_3) is the Weierstrass ...

The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

The nth root (or "nth radical") of a quantity z is a value r such that z=r^n, and therefore is the inverse function to the taking of a power. The nth root is denoted ...

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...