Topological Properties of Telecommunication Networks

  title={Topological Properties of Telecommunication Networks},
  author={Zvi Prihar},
  journal={Proceedings of the IRE},
  • Z. Prihar
  • Published 1 July 1956
  • Business
  • Proceedings of the IRE
This paper describes a method of matrix analysis, developed by Luce and Perry for the study of sociometric group structures and cliques. These concepts are applied to telecommunication networks. Two new traffic matrices are also suggested which, in combination with the connectivity matrices, yield quantitative indications of the incoming and outgoing traffic. Various useful concepts are pointed out and a number of applications are illustrated by numerical examples. 
The Structure of Interactions - an Exploratory Study of the Organization of Networks
  • J. Halina
  • Computer Science
    IEEE Transactions on Communications Systems
  • 1963
A gross measure of organization or structure is introduced, then an arithmetic procedure for the detection of structural pattern in interaction systems is described, which concludes with illustrative examples and a program for further research.
Structure Indicators for Transportation Graph Analysis I: Planar Connected Simple Graphs
The paper deals with the representation of a transportation infrastructure by a planar connected simple graph and aims at studying its features through the analysis of graph properties. All planar
A Bibliography of Communication Network Studies
The study objectives include both the efficient use of present facilities and the optimal design of additional facilities, and the parameters of interest are message delay, error rates, routing controi, and cost.
In this tutorial the author shows how graph theory can be used to model the structural relationships in a behavioral theory. The baśic elements of a graph and its related matrices are defined and
Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation
This paper forms a very convenient continuous characterization of the maximum clique problem based on the symmetric rank-one non-negative approximation of a given matrix and builds a one-to-one correspondence between stationary points of the formulation and cliques of the given graph.
Parallel vertex cover: a case study in dynamic load balancing
It is shown that for certain difficult instances of biological data graphs, the significance of dynamic parallel load balancing is considered in the context of fixed parameter tractability and the approach scales well up to 2400 processors.
On Evaluation of the Graph Trees and the Driving Point Admittance
In this paper a new algorithm called the foldant is proposed, an algebraic method equivalent to the drawing of the graph trees that is no longer necessary to write down a set of node or loop equations nor to remember the lengthy statement of Maxwell's original rule of driving point admittance.
The Animals of Architecture: Some Census Results on N-Omino Populations for N = 6, 7, 8
Some reflections on the nature of architectural solution spaces and design processes based on the experience of conducting this census of three different populations of N-ominoes, and the potential role of polyomino studies in architectural education are presented.
A bibliography of information theory (communication theory - cybernetics) (Third supplement)
This supplement covers eleven major topics with additional minor topics included and the bibliogaphiy covers the following.
Résolution de problèmes de cliques dans les grands graphes
Les problemes MCE (Maximal Clique Enumeration) et MCP (Maximum Clique Problem) sont des problemes que l'on rencontre dans l'analyse des graphes de donnees et leur exploration. Ce sont cepen-dant des


Feedback Theory-Some Properties of Signal Flow Graphs
A study of the topological properties of such graphs leads to techniques which have proven useful, both for the discussion of the general theory of feedback and for the solution of practical analysis problems.
Connectivity and generalized cliques in sociometric group structure
  • R. Luce
  • Mathematics
  • 1950
A generalized concept of clique, called ann-clique, is introduced and n-cliques are shown to have a very close relationship to the existence of cliques in an artificial structure defined on the same set of elements, thus permitting the determination ofn-Cliques by means of the same simple matrix procedures used to obtain the clique structures.
A method of matrix analysis of group structure
This paper describes a matrix method, n-chain and clique, which has simple relationships to the powers of certain matrices and applies it to the analysis of practical examples of group structure.