RUS  ENG
Full version
JOURNALS // Informatics and Automation // Archive

Tr. SPIIRAN, 2017 Issue 53, Pages 5–28 (Mi trspy953)

This article is cited in 6 papers

Theoretical and Applied Mathematics

Numeric features of networking

K. A. Batenkov

The Academy of Federal Security Guard Service of the Russian Federation

Abstract: Networking description issues, in respect to graph theory, occupy a special place in tasks connected with communications network analysis and synthesis by stability indexes. An approach, implying formal representation of a telecommunications network as a non-oriented graph, is traditional. Graph representation variants based on different number stacks or one number instead of diagrams are considered. In some cases, such description significantly simplifies procedures of stability and other index computation. Thus, the tasks of telecommunications network synthesis can be solved not only by enumeration visual methods but also algorithmically. Examples of computing net-working numeric features for elementary versions are given. In the paper, we not only describe analytical instruments for networking structure declaration but also introduce relationships transforming such descriptions into one another.

Keywords: communications network; graph; structure; invariant; adjacency matrix; incidence matrix; mini-code; maxi-code.

UDC: 519.718:004.722

DOI: 10.15622/sp.53.1



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024