Binary Code Properties of Perfect Matching in Hexagonal Graph

Asekha Khantavchai, Thiradet Jiarasuksakun

Abstract

This paper presents the binary code of perfect matching of hexagonal graph and its properties. According to the results, it can be concluded that the hexagonal graph can be substituted by binary code using Klavzar's algorithm. The properties of the obtained binary code could be used in encoding and decoding. In summary, the perfect matchings of the hexagonal graph can be applied in receiving and delivering data after being replaced by the binary code.