  In this article we have derived the minimum order of an odd regular graph
such that the graph has no matching. We have observed that how it is different
from the case of even regular graphs. We have checked the consistency of the
derived result with Petersen's theorem.
