Contents

Ars Combinatoria

  • Research article

The Laplacian Spectral Radius of Graphs With Given Matching Number

Lihua Feng1
1School of Mathematics, Shandong Institute of Business and Technology 191 Binhaizhong Road, Yantai, Shandong, P.R. China, 264005.
  • Published: 31/07/2010

Abstract

In this paper, we obtain the largest Laplacian spectral radius for bipartite graphs with given matching number and use them to characterize the extremal general graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Lihua Feng. The Laplacian Spectral Radius of Graphs With Given Matching Number[J], Ars Combinatoria, Volume 096. 257-262. .