Search Results for ""

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

For some authors (e.g., Bourbaki, 1964), the same as principal ideal domain. Most authors, however, do not require the ring to be an integral domain, and define a principal ...

If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...