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

Aida Abiad (Corresponding author), Boris Brimkov, Sakander Hayat, Antonina P. Khramova, Jack H. Koolen

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
37 Downloads (Pure)

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 [Formula presented]. 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.

Original languageEnglish
Pages (from-to)63-82
Number of pages20
JournalLinear Algebra and Its Applications
Volume693
DOIs
Publication statusPublished - 15 Jul 2024

Funding

Aida Abiad is partially supported by the FWO (Research Foundation Flanders), grant number 1285921N . Antonina P. Khramova is supported by the NWO (Dutch Science Foundation), grant number OCENW.KLEIN.475 . Jack H. Koolen is partially supported by the National Natural Science Foundation of China (No. 12071454 ), Anhui Initiative in Quantum Information Technologies (No. AHY150000 ) and the National Key R and D Program of China (No. 2020YFA0713100 ).

Keywords

  • Block graph
  • Characteristic polynomial
  • Distance matrix

Fingerprint

Dive into the research topics of 'Extending a conjecture of Graham and Lovász on the distance characteristic polynomial'. Together they form a unique fingerprint.

Cite this