Families of Metrized Graphs With Small Tau Constants
No Thumbnail Available
Date
2016
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Basel Ag
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
7
OpenAIRE Views
9
Publicly Funded
No
Abstract
Baker and Rumely's tau lower bound conjecture claims that if the tau constant of a metrized graph is divided by its total length, this ratio must be bounded below by a positive constant for all metrized graphs. We construct several families of metrized graphs having small tau constants. In addition to numerical computations, we prove that the tau constants of the metrized graphs in one of these families, the hexagonal nets around a torus, asymptotically approach to 108 which is our conjectural lower bound.
Description
Keywords
Metrized Graph, Tau Constant, Hexagonal Net Around A Torus, Tau Lower Bound Conjecture, hexagonal net around a torus, Mathematics - Number Theory, FOS: Mathematics, Mathematics - Combinatorics, tau constant, Combinatorics (math.CO), Number Theory (math.NT), metrized graph, tau lower bound conjecture, Graph theory, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), Circuits, networks
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Q3
Scopus Q
Q3

OpenCitations Citation Count
3
Source
Annals of Combinatorics
Volume
20
Issue
2
Start Page
317
End Page
344
PlumX Metrics
Citations
CrossRef : 1
Scopus : 3
Captures
Mendeley Readers : 2
SCOPUS™ Citations
3
checked on Feb 03, 2026
Web of Science™ Citations
3
checked on Feb 03, 2026
Page Views
4
checked on Feb 03, 2026
Google Scholar™


