
doi: 10.1002/net.10033
AbstractFollowing the recursive definition of the hypercube Qn, we define the augmented cube AQn. After showing that its graph is vertex‐symmetric, (2n − 1)‐regular, and (2n − 1)‐connected and that it has diameter ⌈n/2⌉, we describe optimal routing and broadcasting procedures. The augmented cube possesses several embeddable properties that the hypercube and its variations do not possess. © 2002 Wiley Periodicals, Inc.
embedding, Network design and communication in computer systems, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, optimal routing, broadcasting, hypercube
embedding, Network design and communication in computer systems, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, optimal routing, broadcasting, hypercube
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 147 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
