A toughness condition for fractional \((k, m)\)-deleted graphs revisited

DOI10.1007/s10114-019-8169-zzbMath1415.05149OpenAlexW2944187207WikidataQ127900297 ScholiaQ127900297MaRDI QIDQ2311741

Yaojun Chen, Wei Gao, Juan Luis García Guirao

Publication date: 4 July 2019

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-019-8169-z

zbMATH Keywords

toughnessfractional \((k, m)\)-deleted graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (13)

Integrity of graph operations ⋮ Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ Some results on path-factor critical avoidable graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs]
• The eccentric connectivity polynomial of two classes of nanotubes
• A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
• Graph models and mathematical programming in biochemical network analysis and metabolic engineering design
• A toughness condition for fractional \((k,m)\)-deleted graphs
• On designing heteroclinic networks from graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
• A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
• Multiple solutions of the Kirchhoff-type problem in R^N
• A sufficient condition for the existence of a k-factor excluding a given r-factor
• (β ,α)−Connectivity Index of Graphs
• The fifth geometric-arithmetic index of bridge graph and carbon nanocones

This page was built for publication: A toughness condition for fractional \((k, m)\)-deleted graphs revisited