Scholarlink

<p>Let <i>G</i> be a connected graph. The eccentricity matrix of <i>G</i>, denoted by <i>ε</i>(<i>G</i>), is constructed from the distance matrix <i>D</i>(<i>G</i>) by retaining the largest distances in each row and each column, and setting the remaining entries as 0. The <i>ε</i>-spectral radius of <i>G</i> is the largest eigenvalue of <i>ε</i>(<i>G</i>). In this paper, we identify the trees with given order and matching number 6 having the minimum <i>ε</i>-spectral radius, and thus confirm a conjecture proposed by W. Wei, S. Li and L. Zhang in [Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond, Discrete Math., 345 (2022) 112686].</p>

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

The ε-spectral Radii of Trees with Matching Number 6

  • 期刊论文

  • 发表日期：

    2025年11月6日

查看全文
  • Lu Huang,
  • Aimei Yu,
  • Rong-Xia Hao

摘要

Let G be a connected graph. The eccentricity matrix of G, denoted by ε(G), is constructed from the distance matrix D(G) by retaining the largest distances in each row and each column, and setting the remaining entries as 0. The ε-spectral radius of G is the largest eigenvalue of ε(G). In this paper, we identify the trees with given order and matching number 6 having the minimum ε-spectral radius, and thus confirm a conjecture proposed by W. Wei, S. Li and L. Zhang in [Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond, Discrete Math., 345 (2022) 112686].