id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5614	Nour Eldeen, Nawal M.; Badr, Elsayed; Hagag, Ismail M.; Shabana, Hanan	Graph-Based Approach to the Radio Assignment Problem in Wireless Communication Networks with Applications in Cryptography	2025	18	.pdf	application/pdf	7717	448	77	In literature, there are some algorithms for finding an upper bound for radio number of a given graph. The Upper bound of the radio number of a given graph G Input: The adjacency matrix of the graph G and the diameter D of G. Output: The upper bound of radio number of G. Begin 1: For all u ∈ V (G) compute, ds(u)	cache/ejpam-5614.pdf	txt/ejpam-5614.txt