On nonblocking and rearrangeable communication graphs
Kybernetika (1979)
- Volume: 15, Issue: 5, page (359)-365
- ISSN: 0023-5954
Access Full Article
top
How to cite
topNieminen, Juhani. "On nonblocking and rearrangeable communication graphs." Kybernetika 15.5 (1979): (359)-365. <http://eudml.org/doc/28098>.
@article{Nieminen1979,
author = {Nieminen, Juhani},
journal = {Kybernetika},
keywords = {communication graphs; channel graphs; non-blocking networks; rearrangeable networks; graph homomorphism; telecommunication switching networks; subgraphs of the state and assignment graphs; fiber product},
language = {eng},
number = {5},
pages = {(359)-365},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On nonblocking and rearrangeable communication graphs},
url = {http://eudml.org/doc/28098},
volume = {15},
year = {1979},
}
TY - JOUR
AU - Nieminen, Juhani
TI - On nonblocking and rearrangeable communication graphs
JO - Kybernetika
PY - 1979
PB - Institute of Information Theory and Automation AS CR
VL - 15
IS - 5
SP - (359)
EP - 365
LA - eng
KW - communication graphs; channel graphs; non-blocking networks; rearrangeable networks; graph homomorphism; telecommunication switching networks; subgraphs of the state and assignment graphs; fiber product
UR - http://eudml.org/doc/28098
ER -
References
top- V. E. Beneš, Mathematical theory of connecting networks and telephone traffic, Academic Press, New York -London 1965. (1965) MR0210516
- V. E. Beneš, Semilattice characterization of nonblocking networks, Bell System Tech. J. 52 (1973), 697-706. (1973) MR0332349
- K. W. Cattermole, Graph theory and the telecommunications network, Bull. Institute Math. Applic. 11 (1975), 94-107. (1975)
- J. Nieminen, An optimal processing unit graph, Int. J. Syst. Sci. 4 (1973), 309 - 315. (1973) Zbl0266.90058MR0334909
- J. Nieminen, A classification of the vertices of an undirected communication graph G generating a congruence relation on G, Wiss. Z. TH Ilmenau 20 (1974), 55 - 62. (1974) Zbl0275.05111MR0357241
- K. Takagi, Design of multi-stage link systems by means of optimum, channel graphs, Electr. and Comm. Japan 51-A, (1968), 4, 37-46. (1968) MR0262014
- D. A. Waller, Products of graph projections as a model for multistage communication networks, Electr. Lett. 12 (1976), 206-207. (1976) MR0424439
- B. Zelinka, Tolerance graphs, Comment. Math. Univ. Carolinae 9 (1968), 121 - 131. (1968) Zbl0155.51206MR0232698
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.