An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs

zbMATH Open1386.05153MaRDI QIDQ4604362FDOQ4604362

Authors: Wei Gao, Li Liang, Yuhua Chen 

Publication date: 23 February 2018

Recommendations

• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• An isolated toughness condition for fractional \( (a,b,n)\)-critical deleted graphs
• A toughness condition for fractional \((k,m)\)-deleted graphs
• New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
• scientific article

zbMATH Keywords

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (10)

• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect
• Investigation of hybrid nanofluid migration within a porous closed domain
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Sun toughness and path-factor uniform graphs
• Title not available (Why is that?)
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Parameters and fractional factors in different settings
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

This page was built for publication: An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs

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