Binary Code Properties of Perfect Matching in Hexagonal Graph

Asekha Khantavchai, Thiradet Jiarasuksakun


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.


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|