A bridge graph is a special one of those graphs with more than one cut-edge. In this paper, we compute Wiener, hyper-Wiener, PI and vertex PI indices of graphs with more than one cut-edge, which generalize results in [12, 13, 14].
