Abstract | ||
---|---|---|
We establish lower bounds on the matching number of graphs of given odd regularity d and odd girth g, which are sharp for many values of d and g. For d=g=5, we characterize all extremal graphs. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.disc.2013.08.030 | Discrete Mathematics |
Keywords | DocType | Volume |
Matching,Regular graph,Odd girth | Journal | 313 |
Issue | ISSN | Citations |
24 | 0012-365X | 1 |
PageRank | References | Authors |
0.37 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vitor Costa | 1 | 27 | 4.27 |
Simone Dantas | 2 | 119 | 24.99 |
Dieter Rautenbach | 3 | 946 | 138.87 |