Some classes of bipartite graphs induced by Gray codes

Abstract

A Gray code of length n is a list of all binary words of length n such that each two successive codewords differ in only one bit position. If the first and the last codewords also share this property, the Gray code is called cyclic, otherwise it is called non-cyclic. The numbers indicating bit positions in where two successive codewords differ in the list of Gray codes are called transition numbers, and the sequence of these all numbers is called the transition sequence of the Gray code. In this article, bit positions of a Gray code of length n will be counted from 1 up until n. If a graph with vertex set {1, 2, ..., n} having the property that two vertices i and j are adjacent in the graph if and only if, i and j are consecutive transitions in the transition sequence of a Gray code, then the graph is called induced by the Gray code. Some classes of bipartite graphs are shown to be induced by Gray codes. Particularly, we show that complete bipartite graphs are induced by Gray codes.

Combinatorial Gray Codes — an Updated Survey

“…Suparta and van Zanten [SvZ08] constructed a K n -code for any n ⩾ 3; see Figure 2 (i). Moreover, Suparta [Sup17] describes a K k,n−k -code for any 1 ⩽ k ⩽ n − 1. Dimitrov, Dvořák, Gregor, and Škrekovski [DDGŠ13] constructed an n-bit G-code such that G is an induced subgraph of the ⌈log 2 (n)⌉-cube.…”