[PDF][PDF] Three conjectures of Ostrander on digraph Laplacian eigenvectors
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 Schrödinger operators on countable digraphs. We
suggest the open question of deciding if the countability assumption can be dropped from
our main results.
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 Schrödinger operators on countable digraphs. We
suggest the open question of deciding if the countability assumption can be dropped from
our main results.
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 Schrödinger operators on countable digraphs. We suggest the open question of deciding if the countability assumption can be dropped from our main results.
scholar.archive.org
以上显示的是最相近的搜索结果。 查看全部搜索结果