A note on fractional ID- [ a , b ]-factor-critical covered graphs

DOI10.1016/J.DAM.2021.03.004MaRDI QIDQ2161272zbMATH OpenOpenAlexWikidataFDO

Authors Hongxia Liu, Yang Xu, Sizhong Zhou

Publication date 4 August 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.03.004

zbMATH Keywords

fractional ID-\( [ a, b \)-factor]fractional ID-\( [ a, b \)-factor-critical covered graph]minimum degreeneighborhood

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 7559987
• A sufficient condition for fractional ID-\([a,b]\)-factor-critical covered graphs
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs

Cites work

• A degree condition for fractional (g, f, n)-critical covered graphs
• A degree condition for fractional \([a,b]\)-covered graphs
• A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Binding numbers and restricted fractional ( g , f )-factors in graphs
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Degree sum condition for fractional ID-\(k\)-factor-critical graphs
• Existence of all generalized fractional \((g, f)\)-factors of graphs
• Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Remarks on path factors in graphs
• Research on fractional critical covered graphs
• Some existence theorems on path factors with given properties in graphs
• Some results about component factors in graphs
• Some results on path-factor critical avoidable graphs
• Subgraphs with orthogonal factorizations in graphs
• The extension degree conditions for fractional factor
• Toughness, binding number and restricted matching extension in a graph

Cited in

(29)

• Parameters and fractional factors in different settings
• Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Discussion on fractional (a, b, k)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• Path factors in subgraphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Analysis of fractional factor system for data transmission in SDN
• Some sufficient conditions for path-factor uniform graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• scientific article; zbMATH DE number 7559987 (Why is no real title available?)
• scientific article; zbMATH DE number 6606170 (Why is no real title available?)
• Some results about ID-path-factor critical graphs
• Path factors and neighborhoods of independent sets in graphs
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Sufficient conditions for graphs to have strong parity factors
• Feasibility of data transmission under attack: from isolated toughness variant perspective
• Sun toughness and path-factor uniform graphs
• Path-factor critical covered graphs and path-factor uniform graphs
• Remarks on restricted fractional (g, f)-factors in graphs
• Some results about star-factors in graphs
• Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs
• On path-factor critical uniform graphs
• \(A_\alpha\)-spectral conditions for \((a, b, k)\)-factor-critical graphs and fractional \(ID\)-\([a, b]\)-factor-critical covered graphs
• Spectral radius and size conditions for fractional (a,b,l)-critical graphs

This page was built for publication: A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs

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