Let G(R

S) be an interchange graph of () (R

S)

the class of all m×n matrices of 0′s and 1′ s having row sum vector R and column sum vector S. If min {m

n}=2

the authors of [3

4] have shown that the interchange graph G(R

S) are Hamilton--connected

and edge-pancyclic

unless they are K1 or K2. Furthermore

in this paper we show that

if min {m

n}=3

G(R

S) are edge- Hamiltonian unless they are K1 or K2.