On a Lemma of Gromov and the entropy of a graph

  • Authors:

  • Fabio Scarabotti

  • Affiliations:

  • Dipartimento di Metodi e Modelli Matematici, Università degli Studi di Roma "La Sapienza", via A. Scarpa 8, I-00185 Roma, Italy

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

If G is a finite, directed, simple and irreducible graph, deletion of an edge makes the entropy decrease. We give a proof of this fact that avoids the Perron-Frobenius theorem and makes use of a technique developed by Gromov.