Abstract
A function f, defined on the vertices of a graph G, induces nodal domains on the graph. Nodal domains of discrete and metric graphs are of growing interest among physicists and mathematicians. In this paper, several results regarding the nodal domain counts of discrete graphs are derived. One such result is a global upper bound for the number of nodal domains of G, in terms of its chromatic number. Another result is a criterion of resolution of (Laplacian) isospectral graphs via their nodal counts. Several additional results are also shown.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
