Work

Binary Code Properties of Perfect Matching in Hexagonal Graph

Year: 2019

Type: article

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.

Source: Thai Journal of Mathematics

Authors: Asekha Khantavchai, Thiradet Jiarasuksakun

Language: English

Topic: Graph theory and applications

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2935752199

FWCI:

Cites: 3

Cited by:

Related to: 10