Scholarlink

<p>The second largest Laplacian eigenvalue of a graph is the second largest eigenvalue of the associated Laplacian matrix. In this paper, we give sharp upper bounds on the second large Laplacian eigenvalue of a minimally 2-connected graph with given size <i>m</i>.</p>

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

Upper Bounds on the Second Largest Laplacian Eigenvalue of Graphs with Given Size

  • 期刊论文

  • 发表日期：

    2025年11月24日

查看全文
  • Rong Zhang

摘要

The second largest Laplacian eigenvalue of a graph is the second largest eigenvalue of the associated Laplacian matrix. In this paper, we give sharp upper bounds on the second large Laplacian eigenvalue of a minimally 2-connected graph with given size m.