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

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

Authors Dandan Fan, Huiqiu Lin, Hongliang Lu

Publication date 17 May 2022

Published in Discrete Mathematics (Search for Journal in Brave)

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

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)

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.

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

Cites work

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

Cited in

(15)

• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
• A spectral condition for component factors in graphs
• Spectral sufficient conditions for graph factors containing any edge
• Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph
• Turán-type problems on \([a, b]\)-factors of graphs, and beyond
• Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding 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
• Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
• Spectral conditions for graphs having all (fractional) $[a,b]$-factors
• Binding number, \(k\)-factor and spectral radius of 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

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)