Extending a conjecture of Graham and Lov\'{a}sz on the distance characteristic polynomial

DOI10.1016/J.LAA.2023.03.027arXiv2206.07561WikidataQ123253343 ScholiaQ123253343MaRDI QIDQ6402185FDOQ6402185

Jack H. Koolen, Antonina P. Khramova, Boris Brimkov, Sakander Hayat, Aida Abiad

Publication date: 15 June 2022

Abstract: Graham and Lov'{a}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 $lfloorfracn2floor$. 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.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph polynomials (05C31) Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)

This page was built for publication: Extending a conjecture of Graham and Lov\'{a}sz on the distance characteristic polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402185)