Search Results for ""

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...

The American Mathematical Society awards two prizes named in honor of Prof. Frank Nelson Cole, a senior member of the AMS who made a bequest to the society in 1928 upon his ...

There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...