On a trace formula of counting Eulerian cycles
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917913591545856 |
|---|---|
| author | Luo, Ye |
| author_facet | Luo, Ye |
| contents | We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the trace sum of certain twisted vertex and edge adjacency matrices of the graph. Moreover, we show that reduction of computation can be achieved by taking into account symmetries related to twisted adjacency matrices induced by spectral antisymmetry and graph automorphisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_02915 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On a trace formula of counting Eulerian cycles Luo, Ye Combinatorics 05C50, 05C38 We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the trace sum of certain twisted vertex and edge adjacency matrices of the graph. Moreover, we show that reduction of computation can be achieved by taking into account symmetries related to twisted adjacency matrices induced by spectral antisymmetry and graph automorphisms. |
| title | On a trace formula of counting Eulerian cycles |
| topic | Combinatorics 05C50, 05C38 |
| url | https://arxiv.org/abs/2502.02915 |