pith. sign in

arxiv: math-ph/0410059 · v2 · pith:HT5GCDMDnew · submitted 2004-10-28 · 🧮 math-ph · hep-th· math.CO· math.MP· quant-ph

Supersymmetry on Graphs and Networks

classification 🧮 math-ph hep-thmath.COmath.MPquant-ph
keywords graphgraphsnetworksallowsapartapplicationscarrycharacteristics
0
0 comments X
read the original abstract

We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral properties for a class of graph operators which typically encode relevant graph characteristics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.