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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A fundamental characteristic of computer networks is their topologicalstructure. The question of the description of the structural characteristics ofcomputer networks represents a problem that is not completely solved. Searchmethods for structures of computer networks, for which the values of theselected parameters of their operation quality are extreme, have not beencompletely developed. The construction of computer networks with optimumindices of their operation quality is reduced to the solution of discreteoptimization problems over graphs. This paper describes in detail theadvantages of the practical use of k-geodetic graphs [2, 3] in the topologicaldesign of computer networks as an alternative for the solution of thefundamental problems mentioned above which, we believe, are still open. Also,the topological analysis and synthesis of some classes of these networks havebeen performed.

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks