Search Results for ""

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The dodecadodecahedron is the uniform polyhedron with Maeder index 36 (Maeder 1997), Wenninger index 73 (Wenninger 1989), Coxeter index 45 (Coxeter et al. 1954), and Har'El ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

The equilateral elongated square dipyramid, illustrated above together with its net, is Johnson solid J_(15). A version of the elongated square dipyramid that is "squashed" ...

The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...

An Enriques surface X is a smooth compact complex surface having irregularity q(X)=0 and nontrivial canonical sheaf K_X such that K_X^2=O_X (Endraß). Such surfaces cannot be ...

The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...

An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...

A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...