Tight toughness, isolated toughness and binding number bounds for the {K2,Cn}\{K_2,C_n\}-factors

preprint2022arXivOpen access

Abstract

The {K2,Cn}\{K_2,C_n\}-factor of a graph is a spanning subgraph whose each component is either K2K_2 or CnC_n. In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the {K2,C2i+1∣i≥2}\{K_2,C_{2i+1}| i\geq 2 \}-factor for any graph is obtained, which answers a problem due to Gao and Wang (J. Oper. Res. Soc. China (2021), https://doi.org/10.1007/s40305-021-00357-6).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.