✦ LIBER ✦

Deleting vertices and interlacing Laplacian eigenvalues

✍ Scribed by Baofeng Wu; Jiayu Shao; Xiying Yuan

Book ID: 106578396
Publisher: Coastal and Estuarine Research Federation
Year: 2010
Tongue: English
Weight: 139 KB
Volume: 31
Category: Article
ISSN: 1860-6261
DOI: 10.1007/s11401-008-0252-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Laplacian Eigenvalues and multisections

✍ Charles Delorme 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 214 KB

The least eigenvalues of the signless La

The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices

✍ Fan, Yi-Zheng; Wang, Yi; Guo, Huan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Graph Embeddings and Laplacian Eigenvalu

Graph Embeddings and Laplacian Eigenvalues

✍ Guattery, Stephen; Miller, Gary L. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 393 KB

Oscillation and interlacing for various

Oscillation and interlacing for various spectra of the -Laplacian

✍ Paul A. Binding; Bryan P. Rynne 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 724 KB

On the interlacing property for singular

On the interlacing property for singular values and eigenvalues

✍ João Filipe Queiró 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Laplacian eigenvalues and fixed size mul

Laplacian eigenvalues and fixed size multisection

✍ C. Delorme 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 222 KB

For a simple and non-directed graph, bounds on a weighted bisection are related to min and max laplacian eigenvalues, respectively. The purpose of this article is to extend this result to the multisection case where each partition among k has ÿxed size; both bounds rely on eigenvalues of a certain G