Generalised Radio Number of Odd Paths
| dc.contributor.author | Adefokun Tayo Charles | |
| dc.date.accessioned | 2025-06-25T12:17:42Z | |
| dc.date.available | 2025-06-25T12:17:42Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | Generalised Radio labelling of a graph G, an aspect signal assignment problem, and which generalises radio labelling problem, is a non-negative integer function on V (G) of G to the set of positive integer, such that for u, vV (G), | g(u) g(v) | diam(G) d(u, v) k, with diam(G) being the diameter of G and d(u,v), the distance between vertices u and v. The optimum value of span(g) , which the difference between the largest and the smallest radio label on V(G) is the radio number rng(G) of G. This work obtains the generalised radio number for the odd path Pn. | |
| dc.identifier.citation | Adefokun, T. C. (2019). Generalised Radio Number of Odd Paths. Crawford Journal of Natural & Applied Sciences. 1; 13–17. | |
| dc.identifier.uri | https://repository.crawforduniversity.edu.ng/handle/123456789/316 | |
| dc.language.iso | en | |
| dc.publisher | Crawford Journal of Natural & Applied Sciences | |
| dc.relation.ispartofseries | 1 | |
| dc.title | Generalised Radio Number of Odd Paths | |
| dc.type | Article |