On Minimum Order of Odd Regular Graphs Without Perfect Matching
Combinatorics
2019-08-23 v4
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.
Keywords
Cite
@article{arxiv.1407.6247,
title = {On Minimum Order of Odd Regular Graphs Without Perfect Matching},
author = {Anirban Banerjee and Saptarshi Bej},
journal= {arXiv preprint arXiv:1407.6247},
year = {2019}
}
Comments
We have submitted an article with arxiv identifier number arXiv:1509.05476 which cuses the same results as this article. But the philosophy of the article arXiv:1509.05476 is different and more effective. And I found no way to change the title of the article