Spectral radius and traceability of graphs with large minimum degree

被引:1
|
作者
Wei, Jia [1 ]
You, Zhifu [2 ]
机构
[1] South China Univ Technol, Sch Math, Guangzhou, Guangdong, Peoples R China
[2] Guangdong Polytech Normal Univ, Sch Math & Syst Sci, Guangzhou 510665, Guangdong, Peoples R China
来源
LINEAR & MULTILINEAR ALGEBRA | 2020年 / 68卷 / 01期
关键词
Spectral radius; traceable; minimum degree; ANALOGS;
D O I
10.1080/03081087.2018.1500520
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let and , where is an integer. IfG is traceable unless or . Let G be a balanced bipartite graph with order and , where and . IfG is traceable unless , where is the graph obtained from by deleting.
引用
收藏
页码:161 / 176
页数:16
相关论文
共 50 条