The tau constant of a metrized graph and its behavior under graph operations
| dc.creator | Cinkir, Zubeyir | |
| dc.date | 2009-01-05 | |
| dc.date | 2009-05-14 | |
| dc.date.accessioned | 2026-07-07T13:14:18Z | |
| dc.date.available | 2026-07-07T13:14:18Z | |
| dc.description | This paper concerns the tau constant, which is an important invariant of a metrized graph, and which has applications to arithmetic properties of curves. We give several formulas for the tau constant, and show how it changes under graph operations including deletion of an edge, contraction of an edge, and union of graphs along one or two points. We show how the tau constant changes when edges of a graph are replaced by arbitrary graphs. We prove Baker and Rumely's lower bound conjecture on the tau constant for several classes of metrized graphs. | |
| dc.description | Some typos are corrected. 34 pages, 17 figures | |
| dc.identifier | https://arxiv.org/abs/0901.0407 | |
| dc.identifier | http://arxiv.org/abs/0901.0407 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230169 | |
| dc.subject | Combinatorics | |
| dc.subject | Classical Analysis and ODEs | |
| dc.title | The tau constant of a metrized graph and its behavior under graph operations | |
| dc.type | text |