The tau constant of a metrized graph and its behavior under graph operations

From MaRDI portal
Publication:540073

zbMATH Open1217.05218arXiv0901.0407MaRDI QIDQ540073FDOQ540073


Authors: Zübeyir Çınkır Edit this on Wikidata


Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0901.0407

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cited In (8)





This page was built for publication: The tau constant of a metrized graph and its behavior under graph operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540073)