English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

By using the theory of point coloring in graph theory, the algorithm in this article converts the relationship among base stations to the relationship between the vertices and lines in a graph, performs the point coloring for the great connecting diagram on the basis of the thought of the wheel diagram, and then determines whether to complete frequency allocation by certain constraint conditions. In additional, we consider a mapping relation among the sets of vertices and frequency points, so as to reduce the same frequency interference among the cells and improve the quality of communication. Based on the analysis on the example of Yanji, the results show that this optimizing mobile frequency allocation method can effectively improve the robustness of the communication, decrease the same frequency interference between the base stations, and achieve the improvement of communication quality. Keywords-frequency configuration; graph theory; vertex coloring; same frequency interference

A Mobile Frequency Allocation Algorithm Based on the Graph Theory