On Minimum Order of Odd Regular Graphs Without Perfect Matching
From MaRDI portal
Abstract: 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.
This page was built for publication: On Minimum Order of Odd Regular Graphs Without Perfect Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6253389)
