The square of a block graph

The square H 2 of a graph H is obtained from H by adding new edges between every two vertices having distance two in H . A block graph is one in which every block is a clique. For the first time, good characterizations and a linear time recognition of squares of block graphs are given in this paper. Our results generalize several previous known results on squares of trees.