Counting Invertible Schrödinger Operators over Finite Fields for Trees, Cycles and Complete Graphs
Keywords:
Tree, Graph, Enumerative combinatorics, Invariants, Schrödinger operator
Abstract
We count invertible Schrödinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fields for trees, cycles and complete graphs. This is achieved for trees through the definition and use of local invariants (algebraic constructions of perhaps independent interest). Cycles and complete graphs are treated by ad hoc methods.
Published
2015-12-11
How to Cite
Bacher, R. (2015). Counting Invertible Schrödinger Operators over Finite Fields for Trees, Cycles and Complete Graphs. The Electronic Journal of Combinatorics, 22(4), P4.40. https://doi.org/10.37236/5183
Article Number
P4.40