Search Results for ""

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...

A cylindrical wedge, also called a cylindrical hoof or cylindrical ungula, is a wedge cut from a cylinder by slicing with a plane that intersects the base of the cylinder. ...

The most general forced form of the Duffing equation is x^..+deltax^.+(betax^3+/-omega_0^2x)=gammacos(omegat+phi). (1) Depending on the parameters chosen, the equation can ...

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...

Wirsing (1974) showed, among other results, that if F_n(x) is the Gauss-Kuzmin distribution, then lim_(n->infty)(F_n(x)-lg(1+x))/((-lambda)^n)=Psi(x), (1) where ...

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...