A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs

DOI10.22108/TOC.2017.20355zbMath1463.05435OpenAlexW2583614421MaRDI QIDQ5134512

Muhammad Reza Farahani, Yun Gao, Wei Gao

Publication date: 17 November 2020

Full work available at URL: https://doaj.org/article/3c503cf9349f498fbe9b916d809591d5

zbMATH Keywords

fractional factorneighborhood union conditionfractional \((k,n^\prime,m)\)-critical deleted graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

Characteristic sets verses generalized characteristic sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
• A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH
• A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS

This page was built for publication: A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs