Search Results for ""

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...

Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...

A special case of the quadratic Diophantine equation having the form x^2-Dy^2=1, (1) where D>0 is a nonsquare natural number (Dickson 2005). The equation x^2-Dy^2=+/-4 (2) ...

The Riemann zeta function is an extremely important special function of mathematics and physics that arises in definite integration and is intimately related with very deep ...