𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds for Nodal Sets of Eigenfunctions

✍ Scribed by Tobias H. Colding; William P. Minicozzi

Publisher
Springer
Year
2011
Tongue
English
Weight
159 KB
Volume
306
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds for constant degree indepen
Lower bounds for constant degree independent sets
✍ Michael O. Albertson; Debra L. Boutin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 340 KB

Let c(\* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(\* for graphs that are planar, maximal planar, of bounded degree, or trees.