Scholarlink

<p>Let <i>H</i>(4,&#xa0;3) denote the 6-vertex graph obtained from a cycle of length 4 and a triangle by sharing a common vertex. The graph <i>H</i>(4,&#xa0;3) is also known as the fish graph. A graph is said to be <i>H</i>(4,&#xa0;3)-free if it does not contain <i>H</i>(4,&#xa0;3) as a subgraph. In this paper, we consider the extremal problem on spectral radius for <i>H</i>(4,&#xa0;3)-free graphs, and we determine the maximum spectral radius of an <i>H</i>(4,&#xa0;3)-free graph with fixed number of vertices and edges, respectively. Furthermore, we characterize the corresponding extremal graphs.</p>

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

Spectral Extremal Problem on the Fish Graph

  • 期刊论文

  • 发表日期：

    2025年10月20日

查看全文
  • Yanting Zhang,
  • Ligong Wang

摘要

Let H(4, 3) denote the 6-vertex graph obtained from a cycle of length 4 and a triangle by sharing a common vertex. The graph H(4, 3) is also known as the fish graph. A graph is said to be H(4, 3)-free if it does not contain H(4, 3) as a subgraph. In this paper, we consider the extremal problem on spectral radius for H(4, 3)-free graphs, and we determine the maximum spectral radius of an H(4, 3)-free graph with fixed number of vertices and edges, respectively. Furthermore, we characterize the corresponding extremal graphs.