Minimal Volume Entropy of Graphs: an Elementary Proof
The Electronic Journal of Combinatorics · 24.04.2026 · 33 (2)
DOI: 10.37236/14689 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 24.04.2026. Verfasst von Stéphane Sabourau.
Abstract (Originalsprache)
It is known that the minimal volume entropy of a connected finite graph of a given cyclomatic number is attained by a trivalent graph endowed with its combinatorial length. The purpose of this short note is to present a simple geometric proof of this result based solely on elementary combinatorial arguments.
Zitieren
APA
Sabourau, S. (2026). Minimal Volume Entropy of Graphs: an Elementary Proof. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14689
Vancouver
Sabourau S. Minimal Volume Entropy of Graphs: an Elementary Proof. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14689
BibTeX
@article{Sabourau2026,
author = {Sabourau, Stéphane},
title = {Minimal Volume Entropy of Graphs: an Elementary Proof},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14689}
}
EUVIMED