Nodal domain counts and the chromatic number of graphs

DOI10.1088/1751-8113/40/32/008MaRDI QIDQ5757634zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Nodal domain count and vertex bipartiteness.
• A lower bound for nodal count on discrete and metric graphs
• Nodal decompositions of graphs
• Nodal domains on graphs - How to count them and why?
• Nodal domain and eigenvalue multiplicity of graphs

Cited in

(6)

• Nodal domains on graphs - How to count them and why?
• Nodal domain count and vertex bipartiteness.
• A lower bound for nodal count on discrete and metric graphs
• Nodal domain count for the generalized graph \(p\)-Laplacian
• The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757634)