Search Results for ""

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...

The modern definition of the q-hypergeometric function is _rphi_s[alpha_1,alpha_2,...,alpha_r; beta_1,...,beta_s;q,z] ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

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

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...