Name
Abstract | ||
|---|---|---|
Huang and Wu in [IEEE Transactions on Computers 46 (1997), pp. 484-490] introduced the balanced hypercube BHn as an interconnection network topology for computing systems. In this paper, we completely determine the full automorphism group of the balanced hypercube. Applying this, we first show that the n-dimensional balanced hypercube BHn is arc-transitive but not 2-arc-transitive whenever n >= 2. Then, we show that BHn is a lexicographic product of an n-valent graph X-n and the null graph with two vertices, where X-n is a Z(2)(n-1)-regular cover of the n-dimensional hypercube Q(n). |
Year | Venue | Keywords |
|---|---|---|
2017 | ARS MATHEMATICA CONTEMPORANEA | Automorphism group,balanced hypercube,Cayley graph,arc-transitive |
Field | DocType | Volume |
Discrete mathematics,Topology,Combinatorics,Vertex (geometry),Hypercube graph,Folded cube graph,Cayley graph,Network topology,Null graph,Lexicographical order,Mathematics,Hypercube | Journal | 12 |
Issue | ISSN | Citations |
1 | 1855-3966 | 1 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-Xin Zhou | 1 | 156 | 25.22 |
| JinHo Kwak | 2 | 2 | 2.06 |
| Yan-quan Feng | 3 | 350 | 41.80 |
| Zhen-Lin Wu | 4 | 23 | 1.10 |