Abstract
Ostrander proposed three conjectures on the connections between topological properties of a weighted digraph and combinatorial properties of its Laplacian eigenvectors. We verify one of his conjectures, give counterexamples to the other two, and then seek for related valid connections and generalizations to Schrodinger operators on countable digraphs. We suggest the open question of deciding if the countability assumption can be dropped from our main results.
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 callDisclaimer: 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.
