Search Results for ""

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...

The complex conjugate of a complex number z=a+bi is defined to be z^_=a-bi. (1) The conjugate matrix of a matrix A=(a_(ij)) is the matrix obtained by replacing each element ...

The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...

The confluent hypergeometric function of the first kind _1F_1(a;b;z) is a degenerate form of the hypergeometric function _2F_1(a,b;c;z) which arises as a solution the ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...