Search Results for ""

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

For all integers n and nonnegative integers t, the harmonic logarithms lambda_n^((t))(x) of order t and degree n are defined as the unique functions satisfying 1. ...

A minimal surface and double algebraic surface of 15th order and fifth class which can be given by parametric equations x(u,v) = 2sinhucosv-2/3sinh(3u)cos(3v) (1) y(u,v) = ...