%0 Journal Article %1 brouwer05 %A Brouwer, Andries E. %A Haemers, Willem H. %D 2005 %J Linear Algebra and its Applications %K distance-regular eigenvalues graph.theory matching matrix perfect.matching %P 155--162 %R 10.1016/j.laa.2004.08.014 %T Eigenvalues and Perfect Matchings %V 395 %X We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected.

@article{brouwer05, abstract = {We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected.}, added-at = {2016-11-05T11:05:44.000+0100}, author = {Brouwer, Andries E. and Haemers, Willem H.}, biburl = {https://www.bibsonomy.org/bibtex/20eab78bd151b589adf911b995fa344fd/ytyoun}, doi = {10.1016/j.laa.2004.08.014}, interhash = {779a57c959c914ea6576ff1befc456f7}, intrahash = {0eab78bd151b589adf911b995fa344fd}, issn = {0024-3795}, journal = {Linear Algebra and its Applications}, keywords = {distance-regular eigenvalues graph.theory matching matrix perfect.matching}, pages = {155--162}, timestamp = {2017-11-22T02:23:20.000+0100}, title = {Eigenvalues and Perfect Matchings}, volume = 395, year = 2005 }