Graph Laplacians, nodal domains, and hyperplane arrangements

DOI10.1016/j.laa.2004.04.024zbMath1050.05081OpenAlexW2018810998WikidataQ56991520 ScholiaQ56991520MaRDI QIDQ1886532

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

Publication date: 18 November 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.04.024

zbMATH Keywords

Hyperplane arrangementsEigenvectorNodal domainsGraph Laplacians

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items

Minimum supports of eigenfunctions of graphs: a survey, Symmetric matrices, signed graphs, and nodal domain theorems, Nodal decompositions of graphs, Minimum vertex covers and the spectrum of the normalized Laplacian on trees, On the sign patterns of the smallest signless Laplacian eigenvector, Approximations by graphs and emergence of global structures, Random walks and flights over connected graphs and complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Permanental roots and the star degree of a graph
• Evolution on sequence space and tensor products of representation spaces
• Graph partitioning by eigenvectors
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Local search and the local structure of NP-complete problems
• Recent results in the theory of graph spectra
• Eigenfunctions and nodal sets
• Some geometric aspects of graphs and their eigenfunctions
• Another infinite sequence of dense triangle-free graphs
• Random field models for fitness landscapes
• Problems in algebraic combinatorics
• Landscapes and their correlation functions
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Chromatic number and the 2-rank of a graph
• A discrete nodal domain theorem for trees
• On the number of nodal domains of spherical harmonics
• Combinatorial Landscapes
• Random-energy model: An exactly solvable model of disordered systems
• Graph Coloring Using Eigenvalue Decomposition
• The Laplacian Spectrum of a Graph
• Some unsolved problems in the theory of differential equations and mathematical physics
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Eigenvectors of acyclic matrices
• On the mininum number of domains in which the nodal lines of spherical harmonics divide the sphere
• Eigenpolytopes of Distance Regular Graphs
• Amplitude Spectra of Fitness Landscapes
• Algebraic Graph Theory
• Lectures on Polytopes
• On the Quality of Spectral Separators
• The Generalized Walsh Functions
• Discrete nodal domain theorems