版权说明 操作指南
首页 > 成果 > 详情

Characterization of Outerplanar Graphs Whose Second Largest Eigenvalue is at Most 1

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Li, Shuchao;Sun, Wanting
通讯作者:
Shuchao Li<&wdkj&>Wanting Sun
作者机构:
[Li, Shuchao; Sun, Wanting] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
通讯机构:
[Shuchao Li; Wanting Sun] F
Faculty of Mathematics and Statistics, Central China Normal University, Wuhan, People’s Republic of China<&wdkj&>Faculty of Mathematics and Statistics, Central China Normal University, Wuhan, People’s Republic of China
语种:
英文
关键词:
Adjacency matrix;second largest eigenvalue;outerplanar graph;\(\{K_{2, 3}, K_4\}\)-minor free graph
期刊:
Results in Mathematics
ISSN:
1422-6383
年:
2023
卷:
78
期:
3
页码:
1-19
基金类别:
National Natural Science Foundation of China [12171190, 11671164]; Central China Normal University [2022YBZZ033]
机构署名:
本校为第一机构
院系归属:
数学与统计学学院
摘要:
Let $$\lambda _2$$ be the second largest eigenvalue of the adjacency matrix of a connected graph. In 2021, Liu, Chen and Stanić determined all the connected $$\{K_{1,3}, K_5 -e\}$$ -free graphs whose second largest eigenvalue $$\lambda _2\leqslant 1$$ . In this paper, we completely identify all the connected $$\{K_{2,3},K_4\}$$ -minor free graphs whose second largest eigenvalue does not exceed 1. That is, we characterize all the connected outerplanar graphs satisfying $$\lambda _2\leqslant 1$...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com