Document Type

Article

Subject Area(s)

Mathematics

Abstract

In this paper it is shown that if G is a connected graph of order 2n (n > 1) not containing a 1-factor, then for each k, 1

Included in

Mathematics Commons

Share

COinS