Bounds for entries of matrix functions based on Gauss-type quadrature rules are applied to
adjacency matrices associated with graphs. This technique allows to develop inexpensive
and accurate upper and lower bounds for certain quantities (Estrada index, subgraph
centrality, communicability) that describe properties of networks.