id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-860	A. Jeeva	Some Bench Mark Results on Total Domination Subdivision Stable Graph	2024	7	.pdf	application/pdf	2626	169	79	Main Results The focus of this section, we defined Total domination subdivision stable graph and discussed basic properties for obtaining TDSS from a graph G. Definition 2.1 For a given graph G, the total domination number of all graphs derived by subdividing any edge xy of G is same for the total domination number of G which named as total domination subdivision stable. Let t – set for G is D such that x, y  D, x adjacent to y where y is selfish, B ({x, y})  D = . If this is possible for each and every vertices of G, then G is a TDSS.	cache/cana-860.pdf	txt/cana-860.txt