Bounds for the largest pp-Laplacian eigenvalue for graphs

This paper is concerned with techniques for quantitative analysis of the largest pp-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.