Two sufficient conditions for odd \([1,b]\)-factors in graphs

DOI10.1016/j.laa.2022.12.018zbMath1506.05179OpenAlexW4313593837MaRDI QIDQ2682854

Hongxia Liu, Si-zhong Zhou

Publication date: 1 February 2023

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2022.12.018

zbMATH Keywords

spectral radiusgraph sizeodd \([1, b\)-factor]

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (8)

Some results about ID-path-factor critical graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs ⋮ Some sufficient conditions for path-factor uniform graphs

Cites Work

• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• Matching and edge-connectivity in regular graphs
• Component factors with large components in graphs
• Eigenvalues and \([1,n\)-odd factors]
• On factors with all degrees odd
• A sufficient condition for a graph to have \([a,b\)-factors]
• Odd factors of a graph
• Odd subgraphs and matchings
• Eigenvalues and perfect matchings
• Toughness of graphs and the existence of factors
• On the spectrum of an equitable quotient matrix and its application
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Discussions on orthogonal factorizations in digraphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
• Existence of all generalized fractional \((g, f)\)-factors of graphs
• Research on fractional critical covered graphs
• Spectral radius and matchings in graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Simplified existence theorems on all fractional \([a,b\)-factors]
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• Some results on odd factors of graphs
• Stability number and [a,b‐factors in graphs]
• Sharp conditions for the existence of an even $[a,b$-factor in a graph]
• On k-orthogonal factorizations in networks
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Isolated toughness for path factors in networks
• The existence of path-factor uniform graphs with large connectivity
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Eigenvalues and [a,b‐factors in regular graphs]

This page was built for publication: Two sufficient conditions for odd \([1,b]\)-factors in graphs