Elsevier

Discrete Mathematics

Volume 306, Issue 21, 6 November 2006, Pages 2762-2771
Discrete Mathematics

Note
Bounds for the largest p-Laplacian eigenvalue for graphs

https://doi.org/10.1016/j.disc.2006.05.012Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper is concerned with techniques for quantitative analysis of the largest p-Laplacian eigenvalue. We present some bounds on the largest eigenvalue, which generalize those given in the linear case. Some examples of applications are given. Then, we compare our bounds to the classical bounds in the particular case of the trees.

MSC

05C50

Keywords

Graph
Eigenvalue
Discrete p-Laplacian

Cited by (0)