The distinguishing number of the augmented cube and hypercube powers
| dc.creator | Chan, Melody | |
| dc.date | 2006-01-14 | |
| dc.date.accessioned | 2026-07-07T06:58:55Z | |
| dc.date.available | 2026-07-07T06:58:55Z | |
| dc.description | The distinguishing number of a graph G, denoted D(G), is the minimum number of colors such that there exists a coloring of the vertices of G where no nontrivial graph automorphism is color-preserving. In this paper, we show that the distinguishing number of p-th graph power of the n-dimensional hypercube is 2 whenever 2 < p < n-1. This completes the study of the distinguishing number of hypercube powers. We also compute the distinguishing number of the augmented cube, a variant of the hypercube, answering an open question. | |
| dc.description | 10 pages, 1 figure, submitted to Discrete Mathematics | |
| dc.identifier | https://arxiv.org/abs/math/0601361 | |
| dc.identifier | http://arxiv.org/abs/math/0601361 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107557 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C25 (Primary), 05C15 (Secondary) | |
| dc.title | The distinguishing number of the augmented cube and hypercube powers | |
| dc.type | text |