  This work deals with the average scattering entropy of quantum graphs. We
explore this concept in several distinct scenarios that involve periodic,
aperiodic and random distribution of vertices of distinct degrees. In
particular, we compare distinct situations to see how they behave as we change
the arrangements of vertices and the topology and geometry of the proposed
structures. The results show that the average scattering entropy may depend on
the number of vertices, and on the topological and geometrical disposition of
vertices and edges of the quantum graph. In this sense, it can be seen as
another tool to be used to explore geometric and topological effects of current
interest for quantum systems.
