Contents

Ars Combinatoria

  • Research article

The Maximal Signless Laplacian Spectral Radius of Connected Graphs with Given Matching Number

Xiaodan Chen1,2, Fuliang Lu3
1College of Mathematics and Information Science, Guangxi University, Nanning 530004, Guangzi, P.R. China
2Department of Mathematics, Hunan Normal University, Changsha 410081, Hunan, P.R. China
3School of Science, Linyi University, Linyi 276000, Shandong, P.R. China
  • Published: 30/04/2016

Abstract

In this paper, the graphs with maximal (signless Laplacian) spectral radius among all connected graphs with given matching number are characterized.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Xiaodan Chen, Fuliang Lu. The Maximal Signless Laplacian Spectral Radius of Connected Graphs with Given Matching Number[J], Ars Combinatoria, Volume 126. 237-247. .