An upper bound for higher order eigenvalues of symmetric graphs

DOI10.2969/JMSJ/85088508zbMATH Open1481.05099arXiv2006.07632OpenAlexW3189791535MaRDI QIDQ2058823FDOQ2058823

Authors: Shinichiro Kobayashi 

Publication date: 10 December 2021

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

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.

Full work available at URL: https://arxiv.org/abs/2006.07632

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

zbMATH Keywords

symmetric graphgraph Laplacianhigher-order eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Estimates on eigenvalues of Laplacian
• On the Ratio of Consecutive Eigenvalues
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Ratio of Consecutive Eigenvalues in N‐Dimensions

Cited In (2)

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

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)