Bounds of the Radio Number of Stacked-Book Graph with Odd Paths

Simple item page
dc.contributor.authorAdefokun Tayo Charles
dc.contributor.authorAjayi Deborah Olayide
dc.date.accessioned2025-06-25T12:21:07Z
dc.date.available2025-06-25T12:21:07Z
dc.date.issued2022
dc.description.abstractA Stacked-book graph Gm,n is obtained from the Cartesian product of a star graph Sm and a path Pn, where m and s are the orders of the star graph and the path respectively. Obtaining the radio number of a graph is a rigorous process, which is dependent on diameter of G and positive difference of non-negative integer labels f(u) and f(v) assigned to any two u, v in the vertex set V (G) of G. This paper obtains tight upper and lower bounds of the radio number of Gm,n where the path Pn has an odd order. The case where Pn has an even order has been investigated.
dc.identifier.citationAdefokun, T. C. and Ajayi, D. O. (2022). Bounds of the Radio Number of Stacked-Book Graph with Odd Paths. arXiv preprint.
dc.identifier.urihttps://repository.crawforduniversity.edu.ng/handle/123456789/322
dc.language.isoen
dc.publisherarXiv preprint
dc.titleBounds of the Radio Number of Stacked-Book Graph with Odd Paths
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
BOUNDS OF THE RADIO NUMBER OF STACKED-BOOK GRAPH WITH ODD PATHS.pdf
Size:
169.19 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Scholarly work in the Department of Mathematics & Statistics