Extending a Conjecture of Graham and Lovász on the Distance Characteristic Polynomial
LINEAR ALGEBRA AND ITS APPLICATIONS(2024)
摘要
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.
更多查看译文
关键词
Combinatorics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要