547 search results - page 91 / 110 » dm 2008 |
94
Voted
DM
2008
15 years 24 days ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
75
Voted
DM
2008
15 years 25 days ago
2008
Let {Bn(x)} be the Bernoulli polynomials. In the paper we establish some congruences for Bj(x) (mod pn), where p is an odd prime and x is a rational p-integer. Such congruences are...
92
Voted
DM
2008
15 years 25 days ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
DM
2008
15 years 24 days ago
2008
In this paper we study recurrences concerning the combinatorial sum n r m = kr (mod m) n k and the alternate sum kr (mod m)(-1)(k-r)/m n k , where m > 0, n 0 and r are integers....
66
Voted
DM
2008
15 years 24 days ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...