Search Results for ""

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

The Fourier transform of e^(-k_0|x|) is given by F_x[e^(-k_0|x|)](k)=int_(-infty)^inftye^(-k_0|x|)e^(-2piikx)dx = ...

A tetraview is a visualization technique for bivariate complex functions. In the simplest case, the graph of a complex-valued function w=w(z) can be considered as a ...

f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

The wave equation in prolate spheroidal coordinates is del ...