加载中…
Let be a connected graph of order with . A -factor is a spanning subgraph of such that every component of is isomorphic to an element of . Nikiforov introduced the -matrix of as [V. Nikiforov, Merging the - and -spectral theories, Appl. Anal. Discrete Math. 11 (2017) 81–107], where , denotes the diagonal matrix of vertex degrees of and denotes the adjacency matrix of . The largest eigenvalue of , denoted by , is called the -spectral radius of . In this paper, it is proved that has a -factor unless if , where be a real number with .

生成讲解博客的中文版本

生成AI智能校验的中文版本