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

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

doi:10.1016/j.laa.2023.03.027

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

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

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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 ⌊ ⌋. 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 language	English
Pages (from-to)	63-82
Number of pages	20
Journal	Linear Algebra and its Applications
Volume	693
DOIs	https://doi.org/10.1016/j.laa.2023.03.027
Publication status	Published - 15 Jul 2024

Bibliographical note

Funding Information:
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 ).

Publisher Copyright:
© 2023 The Author(s)

Copyright:
Copyright 2023 Elsevier B.V., All rights reserved.

Keywords

Block graph
Characteristic polynomial
Distance matrix

Access to Document

10.1016/j.laa.2023.03.027

Cite this

@article{00a30da5d1b747d398b5ab1c7a1f1804,

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

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 ⌊ ⌋. 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.",

keywords = "Block graph, Characteristic polynomial, Distance matrix",

author = "Aida Abiad and Boris Brimkov and Sakander Hayat and Khramova, {Antonina P.} and Koolen, {Jack H.}",

note = "Funding Information: 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 ). Publisher Copyright: {\textcopyright} 2023 The Author(s) Copyright: Copyright 2023 Elsevier B.V., All rights reserved.",

year = "2024",

month = jul,

day = "15",

doi = "10.1016/j.laa.2023.03.027",

language = "English",

volume = "693",

pages = "63--82",

journal = "Linear Algebra and its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

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

AU - Abiad, Aida

AU - Brimkov, Boris

AU - Hayat, Sakander

AU - Khramova, Antonina P.

AU - Koolen, Jack H.

N1 - Funding Information: 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 ). Publisher Copyright: © 2023 The Author(s) Copyright: Copyright 2023 Elsevier B.V., All rights reserved.

PY - 2024/7/15

Y1 - 2024/7/15

N2 - 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 ⌊ ⌋. 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.

AB - 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 ⌊ ⌋. 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.

KW - Block graph

KW - Characteristic polynomial

KW - Distance matrix

UR - https://www.mendeley.com/catalogue/c668822f-c81b-3e8b-b6d9-7d10aac4a622/

UR - http://www.scopus.com/inward/record.url?scp=85153113114&partnerID=8YFLogxK

U2 - 10.1016/j.laa.2023.03.027

DO - 10.1016/j.laa.2023.03.027

M3 - Article

SN - 0024-3795

VL - 693

SP - 63

EP - 82

JO - Linear Algebra and its Applications

JF - Linear Algebra and its Applications

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this