Spectral radius and [a,b]-factors in graphs

DOI10.1016/J.DISC.2022.112892zbMATH Open1489.05094arXiv2111.01367OpenAlexW3209188005MaRDI QIDQ2138986FDOQ2138986

Authors: Dandan Fan, Huiqiu Lin, Hongliang Lu 

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $aleq{d}_H(v)leqb$ for each $vinV(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum degree $delta$ and the existence of an $[a,b]$-factor in a graph, respectively. Our results generalize and improve some previous results on perfect matchings of graphs. For $a=1$, we extend the result of Ocite{S.O} to obtain an odd $[1,b]$-factor and further improve the result of Liu, Liu and Fengcite{W.L} for $a=b=1$. For $ngeq3a+b-1$, we confirm the conjecture of Cho, Hyun, O and Parkcite{E.C}. We conclude some open problems in the end.

Full work available at URL: https://arxiv.org/abs/2111.01367

Recommendations

• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Fractional matching, factors and spectral radius in graphs involving minimum degree
• scientific article; zbMATH DE number 1117461
• Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs

zbMATH Keywords

spectral radiusunique perfect matching\([ab\)-factor]

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Spectral radius and Hamiltonicity of graphs
• Title not available (Why is that?)
• Matchings in regular graphs from eigenvalues
• Simplified existence theorems on all fractional \([a,b]\)-factors
• Spectral radius and fractional matchings in graphs
• Title not available (Why is that?)
• Stability number and [a,b]‐factors in graphs
• Title not available (Why is that?)
• Inverses of trees
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
• Eigenvalues and perfect matchings
• Regular graphs, eigenvalues and regular factors
• On the maximum number of edges in a hypergraph with a unique perfect matching
• Perfect matchings, eigenvalues and expansion
• Regular factors of regular graphs from eigenvalues
• Large matchings from eigenvalues
• On the spectral radius of graphs with cut edges
• On the structure of graphs with a uniquek-factor
• On graphs with a unique perfect matching
• On the structure of factorizable graphs
• Maximum graphs with a unique k-factor
• On factors with all degrees odd
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fractional matching number and eigenvalues of a graph
• Signless Laplacian spectral radius and fractional matchings in graphs
• A degree condition for the existence ofk-factors
• Title not available (Why is that?)
• Eigenvalues and \([1,n]\)-odd factors
• Inverses of bipartite graphs
• Spectral conditions for graphs to be β-deficient involving minimum degree
• Spectral radius and matchings in graphs
• Sharp conditions for the existence of an even $[a,b]$-factor in a graph
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• Existence of all generalized fractional \((g, f)\)-factors of graphs
• Fractional factors, component factors and isolated vertex conditions in graphs

Cited In (9)

• Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
• The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
• Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
• Binding number, \(k\)-factor and spectral radius of graphs
• Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs
• Fractional matching, factors and spectral radius in graphs involving minimum degree
• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree

This page was built for publication: Spectral radius and \([a,b]\)-factors in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138986)