New dense families of triple loop networks (Q1292809)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New dense families of triple loop networks |
scientific article |
Statements
New dense families of triple loop networks (English)
0 references
25 January 2000
0 references
Multi-loop digraphs are widely studied because of their symmetric properties and their applications to loop networks. The problem is to find the maximum number of vertices for a fixed value of the diameter. For double-loop digraphs, all optimal families have been found by using a geometrical approach. For triple-loop digraphs, only some dense, but possibly not optimal, families are known. In the present paper, some new dense families are given for triple-loop digraphs using a geometrical approach. These families improve previous known results.
0 references
dense digraph
0 references
diameter
0 references
triple-loop digraphs
0 references
0 references