Binary code properties of perfect matching in hexagonal graph

zbMATH Open1479.94094MaRDI QIDQ5018944FDOQ5018944

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

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

zbMATH Keywords

perfect matchingbinary codehexagonal graphKlavzar's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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)