Binary code properties of perfect matching in hexagonal graph

Journal article

Authors/Editors

Strategic Research Themes

Publication Details

Author list: Khantavchai A., Jiarasuksakun T.

Publication year: 2021

Journal: Thai Journal of Mathematics (1686-0209)

Volume number: 19

Issue number: 2

Start page: 593

End page: 605

Number of pages: 13

ISSN: 1686-0209

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85110516729&partnerID=40&md5=fa9cb96056bfb7cefcfda3ea0f9b8734

Languages: English-Great Britain (EN-GB)

View in Web of Science | View citing articles in Web of Science

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. © 2021 by TJM. All rights reserved.

Keywords

Hexagonal graph, Klavzar’s algorithm