No label defined (Q3977500)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 15161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15161 |
Statements
25 June 1992
0 references
partition matrix sequence
0 references
connections
0 references
network
0 references
0.8085731863975525
0 references
0.8069320321083069
0 references
[For the entire collection see Zbl 0679.00004.] Let us consider the following situation. Some object has been split into disjoint areas \(D_ 1,\ldots,D_ k\). In each area there exist contact points which can have connections with points situated inside and outside this area. Let \(V_ i=\{v_{i1},v_{i2},\ldots,v_{is_ i}\}\) be the set of all points in \(D_ i\) and let \(t^ j_{ip}\) denote the number of connections of \(v_{ip}\) with points in \(D_ j\), for \(i,j=1,2,\ldots,k\), \(p=1,2,\ldots,s_ i\). We can formulate the following problems: \(1^ \circ\) What conditions are necessary and sufficient for the numbers \(t^ j_{ip}\) to construct a required network. \(2^ \circ\) How to find a method of constructing a required network. \(3^ \circ\) How to find all networks with given \(t^ j_{ip}\). We obtain more particular question if we look for conditions under which the constructed network has some special properties, e.g. every pair of each area has a direct connection; in each area there are disturbances, so no pair of elements of the same area can be connected; each element of a given area has the same number of connections; each area has its control-point, i.e. every way out of this area must go through this point; every two points of a given area have a connection (not necessarily direct) inside this area. The purpose of this paper is to solve some problems mentioned above by means of graph theory.
0 references