Search Results for ""

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a of the sum (union) x of all sets that are elements of a. The axiom may be stated ...

If the parameters of a Lie group vary over a closed interval, them the Lie group is said to be compact. Every representation of a compact group is equivalent to a unitary ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...