Open Access
November 2008 On the maximal signless Laplacian spectral radius of graphs with given matching number
Guihai Yu
Proc. Japan Acad. Ser. A Math. Sci. 84(9): 163-166 (November 2008). DOI: 10.3792/pjaa.84.163

Abstract

Let $\mathcal{G}_{n,\beta}$ be the set of simple graphs of order $n$ with given matching number $\beta$. In this paper, we investigate the maximal signless Laplacian spectral radius in $\mathcal{G}_{n,\beta}$ and characterize the extremal graphs with maximal signless Laplacian spectral radius.

Citation

Download Citation

Guihai Yu. "On the maximal signless Laplacian spectral radius of graphs with given matching number." Proc. Japan Acad. Ser. A Math. Sci. 84 (9) 163 - 166, November 2008. https://doi.org/10.3792/pjaa.84.163

Information

Published: November 2008
First available in Project Euclid: 31 October 2008

zbMATH: 1175.05090
MathSciNet: MR2483600
Digital Object Identifier: 10.3792/pjaa.84.163

Subjects:
Primary: 05C50 , 05C90 , 15A18‎

Keywords: matching number , Signless Laplacian , spectral radius

Rights: Copyright © 2008 The Japan Academy

Vol.84 • No. 9 • November 2008
Back to Top