EUVIMEDOpdag EUVIMED
Crossref

Minimal Volume Entropy of Graphs: an Elementary Proof

Stéphane Sabourau

The Electronic Journal of Combinatorics · 2026-04-24 · 33 (2)

DOI: 10.37236/14689 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-04-24. Written by Stéphane Sabourau.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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.

Cite

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}
}
Start for free →