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

preprint2022arXivOpen access

Abstract

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order nn is unimodal with the maximum value occurring at ⌊n2⌋\lfloor\frac{n}{2}\rfloor. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.