奇路叠书图的无线电数的界
Bounds of the Radio Number of Stacked-Book Graphs with Odd Paths
摘要：
由星图Sm和路Pn的笛卡儿积得到一个叠书图Gm，n，其中m和s分别是星图和路的阶数.求图的无线电数是一个严格的过程，它依赖于G的直径和G的顶点集V（G）中任意两个u，v所对应的非负整数标号f（u）和f（v）的正差。本文得到了路Pn为奇数阶的Gm，n的无线电数的紧上界和下界.研究了Pn为偶数阶的情形。
英文摘要：
A 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 the 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
