Bibliographic Details
| Title: |
Spectral radius and rainbow matchings of graphs. |
| Authors: |
Guo, Mingyang1 (AUTHOR), Lu, Hongliang1 (AUTHOR) luhongliang215@sina.com, Ma, Xinxin1 (AUTHOR), Ma, Xiao1 (AUTHOR) |
| Source: |
Linear Algebra & its Applications. Dec2023, Vol. 679, p30-37. 8p. |
| Subjects: |
Rainbows, Integers |
| Abstract: |
Let n , m be integers such that 1 ≤ m ≤ (n − 2) / 2 and let [ n ] = { 1 , ... , n }. Let G = { G 1 , ... , G m + 1 } be a family of graphs on the same vertex set [ n ]. In this paper, we prove that if for any i ∈ [ m + 1 ] , the spectral radius of G i is not less than max { 2 m , 1 2 (m − 1 + (m − 1) 2 + 4 m (n − m)) } , then G admits a rainbow matching, i.e. a choice of disjoint edges e i ∈ G i , unless G 1 = G 2 = ... = G m + 1 and G 1 ∈ { K 2 m + 1 ∪ (n − 2 m − 1) K 1 , K m ∨ (n − m) K 1 }. [ABSTRACT FROM AUTHOR] |
|
Copyright of Linear Algebra & its Applications is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
