加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本