✦ LIBER ✦

A Lower Bound for Nodal Count on Discrete and Metric Graphs

✍ Scribed by Gregory Berkolaiko

Book ID: 105902986
Publisher: Springer
Year: 2007
Tongue: English
Weight: 319 KB
Volume: 278
Category: Article
ISSN: 0010-3616
DOI: 10.1007/s00220-007-0391-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamics of Nodal Points and the Nodal C

Dynamics of Nodal Points and the Nodal Count on a Family of Quantum Graphs

✍ Ram Band; Gregory Berkolaiko; Uzy Smilansky 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 795 KB

A lower bound for groupies in graphs

✍ Mackey, John 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 2 views

A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai

A lower bound on cochromatic number for

A lower bound on cochromatic number for line graphs of a kind of graphs

✍ Liu Xinsheng; Chen Xiang’en; Ou Lifeng 📂 Article 📅 2006 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 186 KB

A Note on Bounds for the Supremum Metric

A Note on Bounds for the Supremum Metric for Discrete Random Variables

✍ D. J. Daley 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

On lower bounds for theL2-Wasserstein me

On lower bounds for theL2-Wasserstein metric in a Hilbert space

✍ J. A. Cuesta-Albertos; C. Matrán-Bea; A. Tuero-Diaz 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 781 KB

Lower bound for the discrete norm of a p

Lower bound for the discrete norm of a polynomial on the circle

✍ V. N. Dubinin 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 475 KB