Search Results for ""

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

The Johnson solids are the convex polyhedra having regular faces and equal edge lengths (with the exception of the completely regular Platonic solids, the "semiregular" ...

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...

First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...