On the maximal signless Laplacian spectral radius of graphs with given matching number

29Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Let Gn,β be the set of simple graphs of order n with given matching number β. In this paper, we investigate the maximal signless Laplacian spectral radius in Gn,β and characterize the extremal graphs with maximal signless Laplacian spectral radius. © 2008 The Japan Academy.

Cite

CITATION STYLE

APA

Yu, G. (2008). On the maximal signless Laplacian spectral radius of graphs with given matching number. Proceedings of the Japan Academy Series A: Mathematical Sciences, 84(9), 163–166. https://doi.org/10.3792/pjaa.84.163

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free