An upper bound for higher order eigenvalues of symmetric graphs (Q2058823)

This paper deals with the question of the discrete analogue of the so-called Payne-Pólya-Weinberger's inequality. A finite symmetric graph is a graph whose isomorphism group acts transitively on the set of pairs of adjacency vertices. The author managed to derive an upper bound for higher eigenvalues of the normalized Laplace operator associated with a finite symmetric graph in terms of lower eigenvalues. In this paper, a discrete analogue of \[ \sum_{i=0}^{k} (\lambda_{k+1} - \lambda_i)^2 \leq \sum_{i = 1}^{k} (\lambda_{k+1} - \lambda_{i}) (4 \lambda_{i} + \lambda_{1}), \tag{1} \] which was proved by [\textit{Q.-M. Cheng} and \textit{H. Yang}, Math. Ann. 331, No. 2, 445--460 (2005; Zbl 1122.35086)], is considered. That is, for a finite symmetric graph, a discrete analogue of Equation (1) is proved. Other related properties for some symmetries of eigenfunctions on a symmetric graph are discussed in some details. These properties are then used to prove two main theorems of the paper, namely Theorem 1.1 and Theorem 1.2.