Extending a conjecture of Graham and Lovász on the distance characteristic polynomial

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order n is unimodal with the maximum value occurring at ⌊n2⌋. In this paper we investigate this problem for block graphs. In particular, we prove the unimodality part and we establish the peak for several extremal cases of uniform block graphs with small diameter.