Eigenvalue bounds for the signless \(p\)-Laplacian (Q1753095)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Eigenvalue bounds for the signless p-Laplacian |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalue bounds for the signless \(p\)-Laplacian |
scientific article |
Statements
Eigenvalue bounds for the signless \(p\)-Laplacian (English)
0 references
25 May 2018
0 references
Summary: We consider the signless \(p\)-Laplacian \(Q_p\) of a graph, a generalisation of the quadratic form of the signless Laplacian matrix (the case \(p=2\)). In analogy to Rayleigh's principle the minimum and maximum of \(Q_p\) on the \(p\)-norm unit sphere are called its smallest and largest eigenvalues, respectively. We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds for the smallest eigenvalue in terms of a graph parameter related to the bipartiteness. The latter result generalises bounds by \textit{M. Desai} and \textit{V. Rao} [J. Graph Theory 18, No. 2, 181--194 (1994; Zbl 0792.05096)] and, interestingly, at \(p=1\) upper and lower bounds coincide.
0 references
signless Laplacian
0 references
signless \(p\)-Laplacian
0 references
eigenvalue bound
0 references
0.8196534514427185
0 references
0.8173553347587585
0 references
0.8156312108039856
0 references
0.8152115941047668
0 references
0.8115053176879883
0 references