114
Voted
DM
2008
15 years 23 days ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
60
Voted
DM
2008
15 years 23 days ago
2008
66
Voted
DM
2008
15 years 23 days ago
2008
77
Voted
DM
2008
15 years 23 days ago
2008
Motivated from an application to DNA library screening, Balding and Torney [1] and Colbourn [4] studied the following group testing for consecutive positives. Suppose Vn = {v1 v2 ...
64
Voted
DM
2008
15 years 23 days ago
2008
93
Voted
DM
2008
15 years 23 days ago
2008
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
75
Voted
DM
2008
15 years 23 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...
101
click to vote
DM
2008
15 years 23 days ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
96
Voted
DM
2008
15 years 23 days ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...