View in EDS

Spectral radius and rainbow matchings of graphs.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 173051674
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Spectral radius and rainbow matchings of graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Guo%2C+Mingyang%22">Guo, Mingyang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Lu%2C+Hongliang%22">Lu, Hongliang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> luhongliang215@sina.com</i><br /><searchLink fieldCode="AR" term="%22Ma%2C+Xinxin%22">Ma, Xinxin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Ma%2C+Xiao%22">Ma, Xiao</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Linear+Algebra+%26+its+Applications%22">Linear Algebra & its Applications</searchLink>. Dec2023, Vol. 679, p30-37. 8p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Rainbows%22">Rainbows</searchLink><br /><searchLink fieldCode="DE" term="%22Integers%22">Integers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=173051674
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.laa.2023.09.006
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 30
    Subjects:
      – SubjectFull: Rainbows
        Type: general
      – SubjectFull: Integers
        Type: general
    Titles:
      – TitleFull: Spectral radius and rainbow matchings of graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Guo, Mingyang
      – PersonEntity:
          Name:
            NameFull: Lu, Hongliang
      – PersonEntity:
          Name:
            NameFull: Ma, Xinxin
      – PersonEntity:
          Name:
            NameFull: Ma, Xiao
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 12
              Text: Dec2023
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-print
              Value: 00243795
          Numbering:
            – Type: volume
              Value: 679
          Titles:
            – TitleFull: Linear Algebra & its Applications
              Type: main
ResultId 1