What is it, exactly, that scientists do? How, exactly, do they do it? How is a scientific hypothesis formulated? How does one choose one hypothesis over another? It may be surprising that questionsâ€¦ (More)

Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a graph is aâ€¦ (More)

The problem of transposing a large matrix (that is, one too large to fit in the internal memory of a computer) has been studied by Eklundh [2] and Goldbogen [3]. This problem arises in many practicalâ€¦ (More)

We show that an oblivious Turing Machine which sorts must make non-constantly many reversals. INTRODUCTION: Lower bounds on Turing Machines (TMâ€™s) for polynomial time computations have been difficultâ€¦ (More)

Cordial labelings of graphs were introduced by Cahit [2] as a weakened version of the apparently less tractable grac@/ labelings (see [l]) and harmonious labelings 161. Cahit showed, among otherâ€¦ (More)

The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this note we look at theâ€¦ (More)

We investigate n-vertex graphs in which Pr(degree(v) = d) = c/d for appropriate constant c, that is, the degree sequence exhibits a so-called Zipfian distribution. We apply several well knownâ€¦ (More)