id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-1399	M. Sivasankari	On Decomposing Any Graph G into VDT Graphs	2024	9	.pdf	application/pdf	2990	174	74	Graph G for VDT graph decomposition Step 1 Determine the rooted tree T1 for G from any arbitrary vertex using BFS algorithm. Introduction In the literature of graph theory, graph decomposition is one interesting problem where any graph is decomposed into subgraphs	cache/cana-1399.pdf	txt/cana-1399.txt