|
We establish a novel relation between the nodal domain count and the vertex bipartiteness of a graph, give upper and/or lower bound for the nodal domain count of a graph in terms ofthe independent number, and the diameter, and the chromatic number, and characterize the (connected) graphs $G$ withnodal domain count $4$. |
|
Keywords:nodal domain count, vertex bipartiteness, independent number, diameter, chromatic number |
|