<p>Unimodality of the normalized coefficients of the characteristic polynomials 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 Min4PC 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 of the coefficients of the characteristic polynomial of the Min4PC matrix of any tree on <i>n</i> vertices. Further, we show that the Min4PC matrix of any tree on <i>n</i> vertices is isometrically embeddable in <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3163_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="34" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {R}^{n-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> equipped with the <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3163_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell _1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation>-norm.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Unimodality and peak location of the characteristic polynomials of two distance matrices of trees

  • Rakesh Jana,
  • Iswar Mahato,
  • Sivaramakrishnan Sivasubramanian

摘要

Unimodality of the normalized coefficients of the characteristic polynomials 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 Min4PC 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 of the coefficients of the characteristic polynomial of the Min4PC matrix of any tree on n vertices. Further, we show that the Min4PC matrix of any tree on n vertices is isometrically embeddable in \(\mathbb {R}^{n-1}\) R n - 1 equipped with the \(\ell _1\) 1 -norm.