Nodal domain counts and the chromatic number of graphs

DOI10.1088/1751-8113/40/32/008zbMath1122.05060OpenAlexW2049627286MaRDI QIDQ5757634

Idan Oren

Publication date: 7 September 2007

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8113/40/32/008

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ On the sign patterns of the smallest signless Laplacian eigenvector

This page was built for publication: Nodal domain counts and the chromatic number of graphs