Binary code properties of perfect matching in hexagonal graph

MaRDI QIDQ5018944zbMATH OpenFDO

Authors A. Khantavchai, Thiradet Jiarasuksakun

Publication date 27 December 2021

Full work available at URL http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3284

zbMATH Keywords

binary codehexagonal graphKlavzar's algorithmperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Binary Coding of Resonance Graphs of Catacondensed Polyhexes
• scientific article; zbMATH DE number 975345
• scientific article; zbMATH DE number 4047772
• Binary coding of algebraic Kekulé structures of catacondensed benzenoid graphs
• scientific article; zbMATH DE number 169589

Cites work

• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• On resonance graphs of catacondensed hexagonal graphs: structure, coding, and Hamilton path algorithm

This page was built for publication: Binary code properties of perfect matching in hexagonal graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018944)