图的Aα-谱半径与k-匹配数
The Aα-Spectral Radius and k-Matching Number in Graphs
DOI: 10.12677/PM.2023.131007, PDF,    科研立项经费支持
作者: 李 振, 章 超*：贵州大学，数学与统计学院，贵州 贵阳
关键词: k-匹配理论；谱半径；商矩阵；k-Matching Theory； Spectral Radius； Quotient Matrix
摘要: 令G表示为图，图G的k-匹配是一个函数f，它为G的每个边分配{0,1,…, k}中的一个数，使得G的每个顶点v均有Σe~vf(e)≤k，这里的求和表示取遍所有与定点邻接的边e。在本文中，我们探讨了当k为奇数时，图的Aα-谱半径与整数k-匹配数之间的关系。
Abstract: 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.
文章引用：李振, 章超. 图的Aα-谱半径与k-匹配数[J]. 理论数学, 2023, 13(1): 67-73. https://doi.org/10.12677/PM.2023.131007

参考文献

[1] Lovász, L. and Plummer, M.D. (1986) Matching Theory. Annals of Discrete Mathematics, 29.
[2] Nikiforov, V. (2017) Merging the A- and Q-Spectral Theories. Applicable Analysis and Discrete Mathematics, 11, 81-107. [Google Scholar] [CrossRef] 
[3] Lu, H.L. and Wang, W. (2014) On Perfect k-Matchings. Graphs and Combinatorics, 30, 229-335. [Google Scholar] [CrossRef] 
[4] Tutte, W.T. (1953) The 1-Factors of Oriented Graphs. Proceed-ings of the American Mathematical, 4, 922-931. [Google Scholar] [CrossRef] 
[5] Liu, Y. and Liu, X.H. (2018) Integer k-Matchings of Graphs. Discrete Applied Mathematics, 235, 118-128. [Google Scholar] [CrossRef] 
[6] Pulleyblank, W.R. (1987) Fractional Matching and the Ed-monds-Gallai Theorem. Discrete Applied Mathematics, 16, 51-58. [Google Scholar] [CrossRef] 
[7] Berge, C. (1958) Sur le couplage maximum d’un graphe. Comptes Rendus de l'Académie des Sciences (Paris) 247, 258-259.
[8] Liu, R.F., Lai, H.J., Guo, T.L. and Xue, J. (2020) Fractional Matching Number and Spectral Radius of Nonnegative Matrix of Graphs. Linear and Multilinear Algebra, Article ID: 1865252. [Google Scholar] [CrossRef] 
[9] Godsil, C. and Royle, G. (2001) Algebraic Graph Theory. In: Vakil, R., Ed., Graduate Texts in Mathematics (Vol. 207), Springer-Verlag, New York. [Google Scholar] [CrossRef] 
[10] You, L., Yang, M., So, W. and Xi, W. (2019) On the Spectrum of an Equitable Matrix and Its Application. Linear Algebra and Its Applications, 577, 21-40. [Google Scholar] [CrossRef] 
[11] Liu, Y., Su, X.L. and Xiong, D.N. (2021) Integer k-Matchings of Graphs: k-Berge-Tutte Formula, k-Factor-Critical Graphs and k-Barriers. Discrete Applied Mathematics, 297, 120-128. [Google Scholar] [CrossRef] 
[12] Ore, O. (1963) Hamiltonian Connected Graphs. Journal de Mathématiques Pures et Appliquées, 42, 21-27.

为你推荐