An upper bound for higher order eigenvalues of symmetric graphs

DOI10.2969/JMSJ/85088508MaRDI QIDQ2058823zbMATH OpenOpenAlexFDO

Authors Shinichiro Kobayashi

Publication date 10 December 2021

Published in Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.07632, https://projecteuclid.org/journals/journal-of-the-mathematical-society-of-japan/volume-73/issue-4/An-upper-bound-for-higher-order-eigenvalues-of-symmetric-graphs/10.2969/jmsj/85088508.full

zbMATH Keywords

graph Laplacianhigher-order eigenvaluesymmetric graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Group actions on combinatorial structures (05E18)

Abstract: In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

Review text

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.

Recommendations

• Eigenvalue sum estimates for lattice subgraphs
• Bounds on normalized Laplacian eigenvalues of graphs
• Eigenvalue estimates of the \(p\)-Laplacian on finite graphs
• Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
• Bounds on the negative eigenvalues of Laplacians on finite metric graphs

Cites work

• Estimates on eigenvalues of Laplacian
• scientific article; zbMATH DE number 3710664 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• scientific article; zbMATH DE number 3110482 (Why is no real title available?)
• On the Ratio of Consecutive Eigenvalues
• On the Ratio of Consecutive Eigenvalues in N‐Dimensions

Cited in

(2)

• Generalization of a discrete Opial type inequality applied to the eigenvalues of graph
• Universal inequalities for Dirichlet eigenvalues on discrete groups

This page was built for publication: An upper bound for higher order eigenvalues of symmetric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058823)