id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-2791	G Menon	Inverse Independent Outer Connected Domination Number of Few Classes of Graphs	2024	11	.pdf	application/pdf	4057	202	65	By the definition of Sierpinski graphs, there will be ′k′ copies of S(n, k) incorporated inside S(n + 1, k) and the unit graphs will always be complete graphs and hence we take kn−1 number of vertices from each copy. The Outer Connectedness property : After the removal of one vertex from a complete graph with k vertices , the graph will still be a connected graph .	cache/cana-2791.pdf	txt/cana-2791.txt