The signless p-Laplacian spectral radius of graphs with given matching number

Abstract

In this paper, we consider the spectral radius of signless p-Laplacian of a graph, which is a generalization of the quadratic form of the signless Laplacian matrix for p = 2. Let ${\mathcal{G}}_{n,\beta }$ be the set of simple graphs of order n with a given matching number β. In this paper, the graphs maximizing the largest signless p-Laplacian eigenvalue among ${\mathcal{G}}_{n,\beta }$ are obtained.

Keywords:

• Signless p-Laplacian
• spectral radius
• matching number

AMS classifications:

• 05C50
• 05C40
• 15A18

Disclosure statement

No potential conflict of interest was reported by the author(s).