✦ LIBER ✦

A Faber-Krahn-type inequality for regular trees

✍ Scribed by J. Leydold

Publisher: Springer
Year: 1997
Tongue: English
Weight: 316 KB
Volume: 7
Category: Article
ISSN: 1016-443X
DOI: 10.1007/pl00001623

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faber-Krahn inequality for robin problem

Faber-Krahn inequality for robin problems involvingp-Laplacian

✍ Qiu-yi Dai; Yu-xia Fu 📂 Article 📅 2010 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 290 KB

A Faber-Krahn inequality for Robin probl

A Faber-Krahn inequality for Robin problems in any space dimension

✍ Daniel Daners 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 246 KB

A Faber-Krahn inequality for the Laplaci

A Faber-Krahn inequality for the Laplacian with Generalised Wentzell boundary conditions

✍ James Kennedy 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 276 KB

An alternative approach to the Faber–Kra

An alternative approach to the Faber–Krahn inequality for Robin problems

✍ Dorin Bucur; Daniel Daners 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 193 KB

A proof of the Faber-Krahn inequality fo

A proof of the Faber-Krahn inequality for the first eigenvalue of thep-Laplacian

✍ Tilak Bhattacharya 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 724 KB

A new inequality for distance-regular gr

A new inequality for distance-regular graphs

✍ Paul Terwilliger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Given a nontrivial primitive idempotent E of a distance-regular graph/-with diameter d ~> 3, we obtain an inequality involving the intersection numbers of F for each integer i (3 ~< i ~< d). We show equality is attained for i = 3 if and only if equality is attained for all i (3 ~< i ~< d) if and onl