Open Access
Research Article·pp. 2635–2649·Vol. 47, Issue 7Jul 2026
Log-linear algorithm to generate prime trees
Karnam Gurunadhan Tharunraj, P. Ragukumar
Published Online: 05 Mar 2026DOI: 10.47974/JIOS-2176
In this paper: A graph G is considered to have a prime labeling when each of its |V| vertices is assigned a unique label from the set {1, 2, 3, 4, …,|V|}, ensuring that the labels of any two connected vertices are c...
