✦ LIBER ✦

Graph Laplacians, nodal domains, and hyperplane arrangements

✍ Scribed by Türker Bıyıkoğlu; Wim Hordijk; Josef Leydold; Tomaž Pisanski; Peter F. Stadler

Book ID: 108198730
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 308 KB
Volume: 390
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.04.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph homomorphisms and nodal domains

✍ Amir Daneshgar; Hossein Hajiabolhassan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 137 KB

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adj

[Lecture Notes in Mathematics] Laplacian

[Lecture Notes in Mathematics] Laplacian Eigenvectors of Graphs Volume 1915 || Eigenfunctions and Nodal Domains

✍ Biyikoğu, Türker; Leydold, Josef; Stadler, Peter F. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 351 KB

A Linear Programming Construction of Ful

A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements

✍ Emeric Gioan; Michel Las Vergnas 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 202 KB