Unimodality and peak location of the characteristic polynomials of two distance matrices of trees
Abstract: Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient) are also known. Recently, an extension of these results to distance matrices of block graphs was given. In this work, we extend these results to two additional distance-type matrices associated with trees: the Min-4PC matrix and the 2-Steiner distance matrix. We show that the sequences of coefficients of the characteristic polynomials of these matrices are both unimodal and log-concave. Moreover, we find the peak location for the coefficients of the characteristic polynomials of the Min-4PC matrix of any tree on $n$ vertices. Further, we show that the Min-4PC matrix of any tree on $n$ vertices is isometrically embeddable in $\mathbb{R}{n-1}$ equipped with the $\ell_1$ norm.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.