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

DOI10.1007/978-3-031-35949-1_11MaRDI QIDQ6148098zbMATH OpenOpenAlexFDO

Authors 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

close-by-onehypercubemaximal independence polynomialmaximal independent set

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Maximal independent sets in the covering graph of the cube
• Counting maximal antichains and independent sets
• The number of maximal independent sets in the Hamming cube
• Coverings, matchings and the number of maximal independent sets of graphs
• Order structure of good sets in hypercube

Cites work

• A New Algorithm for Generating All the Maximal Independent Sets
• ARPACK Users' Guide
• Conceptual exploration
• Counting maximal antichains and independent sets
• Estimating the size of correcting codes using extremal graph problems
• Exact algorithms for maximum independent set
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• Maximal independent sets in the covering graph of the cube
• On cliques in graphs
• On the maximal independence polynomial of certain graph configurations
• Statistical analysis of financial networks
• The number of maximal independent sets in the Hamming cube

Cited in

(1)

• Order structure of good sets in hypercube

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

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