The scattering matrix of a graph
From MaRDI portal
Summary: Recently, Smilansky expressed the determinant of the bond scattering matrix of a graph by means of the determinant of its Laplacian. We present another proof for this Smilansky's formula by using some weighted zeta function of a graph. Furthermore, we reprove a weighted version of Smilansky's formula by Bass' method used in the determinant expression for the Ihara zeta function of a graph.
Recommendations
Cited in
(10)- Quaternionic Grover walks and zeta functions of graphs with loops
- A combinatorial approach to scattering diagrams
- The scattering matrix with respect to an Hermitian matrix of a graph
- An extension of Smilansky's formula to a digraph
- Geometric properties of quantum graphs and vertex scattering matrices
- Exact scattering matrix of graphs in magnetic field and quantum noise
- Scattering theory on graphs
- The quaternionic second weighted zeta function of a graph and the Study determinant
- The trace formula with respect to the Grover matrix of a graph
- Imaging geometric graphs using internal measurements
This page was built for publication: The scattering matrix of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010823)