Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.19698 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914850996748288 |
|---|---|
| author | Cui, Linlin Li, Feng |
| author_facet | Cui, Linlin Li, Feng |
| contents | As the most critical component in the communication process, channels have a great impact on the communication quality of network. With the continuous expansion of network scale, the limited channel resources lead to the limitation of communication network scale. Therefore, achieving reasonable channel assignment and utilization becomes an extremely challenging problem. In order to solve this issue effectively, the channel assignment problem in communication networks can be transformed into a graph labeling problem, utilizing graphs to simulate the communication networks. In this paper, the topologies of mesh networks and stars are studied by constructing Cartesian product, and the lower bound and exact value of the optimal radio label of the Cartesian product of square mesh network and star $G=P(m,m)\Box K_{1,n}$ are obtained, where $m\geq 2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19698 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal radio labeling for the Cartesian product of square mesh networks and stars Cui, Linlin Li, Feng Combinatorics As the most critical component in the communication process, channels have a great impact on the communication quality of network. With the continuous expansion of network scale, the limited channel resources lead to the limitation of communication network scale. Therefore, achieving reasonable channel assignment and utilization becomes an extremely challenging problem. In order to solve this issue effectively, the channel assignment problem in communication networks can be transformed into a graph labeling problem, utilizing graphs to simulate the communication networks. In this paper, the topologies of mesh networks and stars are studied by constructing Cartesian product, and the lower bound and exact value of the optimal radio label of the Cartesian product of square mesh network and star $G=P(m,m)\Box K_{1,n}$ are obtained, where $m\geq 2$. |
| title | Optimal radio labeling for the Cartesian product of square mesh networks and stars |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.19698 |