Graphs with restricted valency and matching number

Consider the family of all finite graphs with maximum degree Δ ( G ) < d and matching number ν ( G ) < m . In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique.