Title of article
Graphs with restricted valency and matching number
Author/Authors
Balachandran، نويسنده , , Niranjan and Khare، نويسنده , , Niraj، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
4176
To page
4180
Abstract
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.
Keywords
Sunflower , Factor-critical graph , Gallai’s lemma
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598916
Link To Document