Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.02111 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910683528953856 |
|---|---|
| author | Cinkir, Zubeyir |
| author_facet | Cinkir, Zubeyir |
| contents | We give identities for the voltage and resistance functions on a metrized graph to show how these functions behave under any edge deletion/contraction and the identification of any two vertices. This leads to explicit versions of Rayleigh's Principles on a resistive electrical network. We also establish Euler's Identities for the resistance and the voltage functions on an electrical network. One can use these results to study various invariants of metrized graphs and electrical networks. As a specific application, we obtain various identities for the total number of spanning trees of a graph. For example, we show how the total number of spanning trees changes under graph operations such as, contraction of an edge, deletion of an edge, deletion of a vertex, the join of arbitrary two or three vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02111 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Explicit Rayleigh's Principles for Resistive Electrical Network and The Total Number of Spanning Trees of Graphs Cinkir, Zubeyir Combinatorics We give identities for the voltage and resistance functions on a metrized graph to show how these functions behave under any edge deletion/contraction and the identification of any two vertices. This leads to explicit versions of Rayleigh's Principles on a resistive electrical network. We also establish Euler's Identities for the resistance and the voltage functions on an electrical network. One can use these results to study various invariants of metrized graphs and electrical networks. As a specific application, we obtain various identities for the total number of spanning trees of a graph. For example, we show how the total number of spanning trees changes under graph operations such as, contraction of an edge, deletion of an edge, deletion of a vertex, the join of arbitrary two or three vertices. |
| title | Explicit Rayleigh's Principles for Resistive Electrical Network and The Total Number of Spanning Trees of Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.02111 |