图的A_α-谱半径与k-匹配数

The A_α-Spectral Radius and k-Matching Number in Graphs

令G表示为图,图G的k-匹配是一个函数f,它为G的每个边分配{0,1,…, k}中的一个数,使得G的每个顶点v均有Σe~vf(e)≤k,这里的求和表示取遍所有与定点邻接的边e。在本文中,我们探讨了当k为奇数时,图的Aα-谱半径与整数k-匹配数之间的关系。

Let G be a graph. A k-matching of G is a function f that assigns to each edge of G a number in {0,1,…, k} so that Σe~vf(e)≤k for each vertex v of G, where the sum is taken over all edges e incident with v. In our paper, we explore the relationship between Aα-spectral radius and integer k-matching number in general graphs when k is odd.