A sufficient condition for the existence of a k-factor excluding a given r-factor
From MaRDI portal
Publication:4597678
DOI10.21042/AMNS.2017.1.00002zbMath1375.05222MaRDI QIDQ4597678
Lan Xu, Yang Xu, Si-zhong Zhou
Publication date: 14 December 2017
Published in: Applied Mathematics and Nonlinear Sciences (Search for Journal in Brave)
Related Items (7)
Chaotic synchronization based on fractional order calculus financial system ⋮ Hamilton-connectivity of interconnection networks modeled by a product of graphs ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ Parameters and fractional factors in different settings ⋮ Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs ⋮ Least eigenvalue of the connected graphs whose complements are cacti ⋮ Dynamic analysis and adaptive modified projective synchronization for systems with Atangana-Baleanu-Caputo derivative: a financial model with nonconstant demand elasticity
Cites Work
- Unnamed Item
- A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
- A minimum degree condition of fractional \((k,m)\)-deleted graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Perfect matchings of a graph
- TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
- Remarks on orthogonal factorizations of digraphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- Binding number and Hamiltonian (g, f)-factors in graphs II
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Some new sufficient conditions for graphs to have fractionalk-factors
- Combinatorial Geometry and Graph Theory
- The binding number of a graph and its Anderson number
- The Factors of Graphs
This page was built for publication: A sufficient condition for the existence of a k-factor excluding a given r-factor
