id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ajema-6563	Karimovna, Urakova Dilnoza	Method for Determining Non-Isomorphism of Graphs	2025	4	.htm	application/pdf	2063	155	56	It is currently unknown whether the problem of checking graph isomorphism is solvable in polynomial time [11, 31], but it is known that this problem can be solved in polynomial time for some classes of graphs. To conduct computational experiments, it is assumed to use a set of graphs obtained using certain generation algorithms (including graph generation algorithms developed by the author).	cache/ajema-6563.htm	txt/ajema-6563.txt