The tau constant and the edge connectivity of a metrized graph
| dc.creator | Cinkir, Zubeyir | |
| dc.date | 2009-01-12 | |
| dc.date | 2009-05-20 | |
| dc.date.accessioned | 2026-07-07T13:16:18Z | |
| dc.date.available | 2026-07-07T13:16:18Z | |
| dc.description | The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We discover identities which we call "contraction", "deletion", and "contraction-deletion" identities on a metrized graph. By establishing a lower bound for the tau constant in terms of the edge connectivity, we prove that Baker and Rumely's lower bound conjecture on the tau constant holds for metrized graphs with edge connectivity 5 or more. We show that proving this conjecture for 3-regular graphs is enough to prove it for all graphs. | |
| dc.description | Various typos are corrected. Some minor changes made to the content. However, all the results remain the same. 27 pages, 6 figues | |
| dc.identifier | https://arxiv.org/abs/0901.1481 | |
| dc.identifier | http://arxiv.org/abs/0901.1481 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230750 | |
| dc.subject | Combinatorics | |
| dc.subject | Classical Analysis and ODEs | |
| dc.title | The tau constant and the edge connectivity of a metrized graph | |
| dc.type | text |