Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

DM
2002

favoriteEmaildiscussreport

104views more DM 2002»

Graphs induced by Gray codes

13 years 11 months ago

Graphs induced by Gray codes

Download www.oberlin.edu

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

Elizabeth L. Wilmer, Michael D. Ernst

Real-time Traffic

Arbitrarily Large | Cyclic Graphs | Cyclic Gray Codes | DM 2002 |

claim paper

Related Content

» Gray Code Enumeration of Plane StraightLine Graphs

» Restricted compositions and permutations From old to new Gray codes

» ConstantWeight Gray Codes for Local Rank Modulation

» Generalized Gray Codes for Local Rank Modulation

» Quantizers with Uniform Encoders and Channel Optimized Decoders

» Gray Code Compression

» Countable connectedhomogeneous graphs

» Permuting Web Graphs

» Hybrid Optimizations Which Optimization Algorithm to Use

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Elizabeth L. Wilmer, Michael D. Ernst

Comments (0)