On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)

DOI10.1007/978-3-031-35949-1_11OpenAlexW4383212609MaRDI QIDQ6148098

Dmitry I. Ignatov

Publication date: 11 January 2024

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-35949-1_11

zbMATH Keywords

hypercubemaximal independent setclose-by-onemaximal independence polynomial

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Maximal independent sets in the covering graph of the cube
• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• On the maximal independence polynomial of certain graph configurations
• Statistical analysis of financial networks
• Exact algorithms for maximum independent set
• Counting maximal antichains and independent sets
• The number of maximal independent sets in the Hamming cube
• Conceptual Exploration
• Estimating the size of correcting codes using extremal graph problems
• A New Algorithm for Generating All the Maximal Independent Sets
• ARPACK Users' Guide
• On cliques in graphs

This page was built for publication: On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)