A construction of Gray codes inducing complete graphs

Discrete Mathematics

Volumn 308, Issue 18, 2008, Pages 4124-4132

  Suparta, I Nengah ^a   van Zanten, A J ^b  

^a UNIVERSITAS PENDIDIKAN GANESHA   (Indonesia)

^b Department of Microelectronics   (Netherlands)

Author keywords

Complete graph; Gray code

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY;

(N ,R) GRAY CODE; COMPLETE GRAPHS;

CODES (STANDARDS);

EID: 44849106418     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.116     Document Type: Article

References (12)

1. Ádám A. Truth Functions and the Problem of their Realization by Two-Terminal Graphs (1968), Akadémiai Kiadó, Budapest
2. Bultena B., and Ruskey F. Transition restricted Gray codes. Electron. J. Combin. 3 (1996) #R11
3. Gilbert E.N. Gray codes and path on the n-cube. Bell System Tech. J. 37 (1958) 815-826
4. Goddyn L., and Gvozdjak P. Binary Gray codes with long bit runs. Electron. J. Combin. 10 (2003) #R27
5. Goddyn L., Lawrence G.M., and Nemeth E. Gray codes with optimized run lengths. Utilitas Math. 34 (1988) 179-192
6. D.E. Knuth, The Art of Computer Programming, vol. 4, Addison-Wesley as part of "fascicle" 2, USA, 2005.
7. Robinson J.P., and Cohn M. Counting sequences. IEEE Trans. Comput. C-30 (1981) 17-23
8. Savage C.D., and Winkler P. Monotone Gray codes and the middle levels problems. J. Combin. Theory Ser. A 70 (1995) 230-248
9. I.N. Suparta, A.J. van Zanten, Balanced Gray codes, Report CS 03-03, Department of Computer Science, Universiteit Maastricht, The Netherlands, 2003.
10. Vickers V.E., and Silverman J. A technique for generating specialized Gray codes. IEEE Trans. Comput. C-29 (1980) 329-331
11. Wilmer E.L., and Ernst M.D. Graphs induced by Gray codes. Discrete Math. 257 (2002) 585-598
12. van Zanten A.J., and Suparta IN. Totally balanced and exponentially balanced Gray codes. J. Discrete Anal. Oper. Res. 11 (2004) 81-98