id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-843	S. Sheeja	The Forcing Circular Number of a Graph	2024	10	.pdf	application/pdf	4555	288	83	It is simple to see that 𝑐𝑟(𝐺) ≥ 𝑏 + 2 as every circular set of 𝐺 has at least one vertex from each 𝐻𝑖(1 ≤ 𝑖 ≤ 𝑎). 𝑎e, let 𝑇 be any suitable subset of 𝑆. After that, 𝑐𝑗 (1 ≤ 𝑗e ≤ 𝑎) is a vertex such that 𝑐𝑗 ∉ 𝑇. Assume that 𝑏𝑗, a vertex of 𝐻𝑗, is different from 𝑐𝑗. Subseequently, 𝑆1 = (𝑆 − {𝑐𝑗}) ∪ {𝑏𝑗} is a 𝑐𝑟-set that correctly contains 𝑇. 𝑇 is not a forced subset of 𝑆” as a result.	cache/cana-843.pdf	txt/cana-843.txt