id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-5925	S. Selestin Lina	Topological Cordial Labeling of some Graphs	2025	7	.pdf	application/pdf	1900	119	71	+ 1, 𝑤ℎ𝑒𝑟𝑒 𝑣𝑖+1 = 𝑣𝑖} ∪ { 𝑢𝑖𝑢𝑖+1/1 ≤ 𝑖 ≤ 𝑖 + 1, 𝑤ℎ𝑒𝑟𝑒 𝑢𝑖+1 = 𝑢𝑖} ∪ {𝑤𝑖𝑤𝑖+1/1 ≤ 𝑖 ≤ 𝑖 If the induced function f^* on E(G) is defined by f^* (uv)={■(1 if f(u)∩f(v) is not an empty set and singleton set@0 otherwise )┤ for every uv∈E(G) such that |e_f (0)-e_f (1)|≤1 where e_f (0)= number of edges labeled with 0 and〖 e〗 _f (1)= number of edges labeled with 1 then f is a topological cordial labeling and a graph which admits such a labeling is called topological cordial graph.	cache/cana-5925.pdf	txt/cana-5925.txt