Isolated toughness for path factors in networks

DOI10.1051/RO/2022123zbMath1497.05223OpenAlexW4286008621MaRDI QIDQ5104626

Wei Zhang, Su-fang Wang

Publication date: 15 September 2022

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

Full work available at URL: https://doi.org/10.1051/ro/2022123

zbMATH Keywords

isolated toughness\(P_{\geq k}\)-factor\((P_{\geq k}, n)\)-factor-critical covered graph\(P_{\geq k}\)-factor covered graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs ⋮ Some sufficient conditions for path-factor uniform graphs

This page was built for publication: Isolated toughness for path factors in networks