Graphs induced by Gray codes

We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are trees of arbitrarily large diameter. We answer affirmatively two other questions from [1], showing that strongly Pn

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Elizabeth L. Wilmer, Michael D. Ernst
• Keywords: Arbitrarily Large, Cyclic Graphs, Cyclic Gray Codes, DM 2002