Independence number and connectivity for fractional (a, b, k)-critical covered graphs

DOI10.1051/RO/2022119zbMath1497.05226arXiv1909.01070OpenAlexW2972107684MaRDI QIDQ5104620

Hongxia Liu, Jian-Cheng Wu, Si-zhong Zhou

Publication date: 15 September 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.01070

zbMATH Keywords

networkindependence numberconnectivityfractional \([a, b\)-factor]

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (8)

A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Tight isolated toughness bound for fractional \((k, n)\)-critical graphs

This page was built for publication: Independence number and connectivity for fractional (a, b, k)-critical covered graphs