id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-5924	R. Radha, N. Mohamed Rilwan	Edge binary coding of Cayley network	2024	9	.pdf	application/pdf	2403	136	68	Edge binary coding on Cayley graph For convenience, the vertex set 𝑉(𝒢) contains the elements of a finite group 𝛤 and the edge set 𝐿(𝒢) can be split into the sets N and 𝑆 whose edges are generated by the non-self inverse elements and self inverse elements of 𝛤 respectively. Conclusion Basically, Cayley graphs are the good network model, by implementing this edge binary encoding analogue on any practical problem, whose configuration resembles the Cayley graph at that instance, multiple non-binary output can be gained by the polynomial time algorithm as a decoder.	cache/cana-5924.pdf	txt/cana-5924.txt