The author introduces the row-difference monotonic matrix for irreducible matrices, which is an extension of the row-column monotonic matrix and means that every row of the matrix subtracted from the next row gives a monotonic increasing sequence. He proves that discrete event systems corresponding to these matrices are strongly stable using graph theoretic methods. The above results are extended for some reducible matrices and are applied to a process system.