We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER.
- Authors
Pineda-Villavicencio, Guillermo
- Abstract
The article discusses the study on the design of optimal interconnection networks. The study shows that optimality is the largest possible number of nodes in the network under given constraints on the number of connections attached to a node and the length of shortest paths between any two nodes. It also explores on the degree or diameter problem for both general graphs and bipartite graphs which proved their rarity. Furthermore, it mentions that regular topologies with the smallest possible number of vertices given degree and girth are also investigated in which case the bipartite Moore bound is known as lower bound on the minimum number of vertices of such topologies.
- Subjects
TOPOLOGICAL degree; ALGEBRAIC topology; DIAMETER; TOPOLOGY; BIPARTITE graphs; TOPOLOGICAL graph theory; VERTEX operator algebras; ALGEBRA; NETWORK analysis (Planning)
- Publication
Bulletin of the Australian Mathematical Society, 2010, Vol 81, Issue 2, p350
- ISSN
0004-9727
- Publication type
Article
- DOI
10.1017/S0004972709000896