Showing math.COShow all
2 papers · 1 filter
math.CO2023
Two spectral extremal results for graphs with given order and rank
Xiuqing Li, Xian'an Jin, Chao Shi +1
The spectral radius and rank of a graph are defined to be the spectral radius and rank of its adjacency matrix, respectively. It is an important problem in spectral extremal graph…
math.CO2022
Tight toughness, isolated toughness and binding number bounds for the -factors
Xiaxia Guan, Tianlong Ma, Chao Shi
The -factor of a graph is a spanning subgraph whose each component is either or . In this paper, a sufficient condition with regard to tight toughness, isol…