GRAY CODES AND PATHS ON THE N-CUBE

被引：144
|
作者：
GILBERT, EN
机构：
来源：
BELL SYSTEM TECHNICAL JOURNAL | 1958年 / 37卷 / 03期
关键词：
D O I：
10.1002/j.1538-7305.1958.tb03887.x
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：815 / 826
页数：12
相关论文
共 50 条
  • [41] On the metric dimension of the folded n-cube
    Zhang, Yuezhong
    Hou, Lihang
    Hou, Bo
    Wu, Weili
    Du, Ding-Zhu
    Gao, Suogang
    OPTIMIZATION LETTERS, 2020, 14 (01) : 249 - 257
  • [42] New results on the resistance of an n-cube
    Yang, YX
    Lou, JH
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1997, 144 (01): : 51 - 52
  • [43] THE TWISTED N-CUBE WITH APPLICATION TO MULTIPROCESSING
    ESFAHANIAN, AH
    NI, LM
    SAGAN, BE
    IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (01) : 88 - 93
  • [44] Lower bounds for the simplexity of the n-cube
    Glazyrin, Alexey
    DISCRETE MATHEMATICS, 2012, 312 (24) : 3656 - 3662
  • [45] NUMBER OF HAMILTONIAN CIRCUITS IN N-CUBE
    DIXON, E
    GOODMAN, S
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 50 (JUL) : 500 - 504
  • [46] Neighborhoods of unbordered words in the n-cube
    Cummings, L.J.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 70 : 97 - 106
  • [47] Stratified random walks on the n-cube
    Chung, FRK
    Graham, RL
    RANDOM STRUCTURES & ALGORITHMS, 1997, 11 (03) : 199 - 222
  • [48] A subspace covering problem in the n-cube
    Aydinian, Harout
    DISCRETE APPLIED MATHEMATICS, 2017, 216 : 513 - 517
  • [49] A STRONG FACTORIZATION OF THE GRAPH OF THE N-CUBE
    BIALOSTOCKI, A
    ARS COMBINATORIA, 1986, 22 : 77 - 80
  • [50] ON EDGE NUMBERINGS OF THE N-CUBE GRAPH
    BEZRUKOV, S
    GRUNWALD, N
    WEBER, K
    DISCRETE APPLIED MATHEMATICS, 1993, 46 (02) : 99 - 116
12345