The Faber-Krahn type isoperimetric inequalities for a graph

DOI10.2748/TMJ/1178224816zbMath0932.05054OpenAlexW2019827208MaRDI QIDQ1306676

Hajime Urakawa, Atsushi Katsuda

Publication date: 13 March 2000

Published in: Tôhoku Mathematical Journal. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2748/tmj/1178224816

zbMATH Keywords

Dirichlet problemeigenvalueLaplacianFaber-Krahn inequality

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Faber-Krahn type inequalities for trees ⋮ Ordering trees by the spectral radius of Laplacian

Cites Work

• Unnamed Item
• Spectral geometry: direct and inverse problems. With an appendix by G. Besson
• Some geometric aspects of graphs and their eigenfunctions
• On the First Eigenvalue of the Combinatorial Laplacian for a Graph.
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks

This page was built for publication: The Faber-Krahn type isoperimetric inequalities for a graph