Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call