Some classes of bipartite graphs induced by Gray codes
<pre>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...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
| Colección: | Electronic Journal of Graph Theory and Applications |
| Materias: | |
| Acceso en línea: | http://www.ejgta.org/index.php/ejgta/article/view/354 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|