Minimal Volume Entropy of Graphs: an Elementary Proof

Abstract

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.