Nodal domain count and vertex bipartiteness.

zbMATH Open1488.05193MaRDI QIDQ4558671FDOQ4558671

Authors: Zuojuan Luo, Bo Zhou 

Publication date: 29 November 2018

Recommendations

• Nodal domain theorems and bipartite subgraphs
• Nodal domain counts and the chromatic number of graphs
• Nodal domains on graphs - How to count them and why?
• Nodal domain and eigenvalue multiplicity of graphs
• A lower bound for nodal count on discrete and metric graphs

zbMATH Keywords

chromatic numberdiameterindependent numbervertex bipartitenessnodal domain count

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Nodal domains on graphs - How to count them and why?
• On maximal energy of line graphs with given parameters
• Nodal domain theorems and bipartite subgraphs
• Nodal domain counts and the chromatic number of graphs

This page was built for publication: Nodal domain count and vertex bipartiteness.

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