Counting the maximal independent sets in power set graphs

MaRDI QIDQ5740795zbMATH OpenFDO

Authors M. A. Shalu, S. Devi Yamini

Publication date 20 July 2016

zbMATH Keywords

maximum independent setGolomb's recurrencepower set graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Counting the number of independent sets in chordal graphs
• Counting maximal independent sets in directed path graphs
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 2188478
• On independent sets and bicliques in graphs

Cited in

(9)

• An extension of the Win theorem: counting the number of maximum independent sets
• Counting maximal independent sets in directed path graphs
• Fourier analysis and large independent sets in powers of complete graphs
• Counting the number of independent sets in chordal graphs
• Counting Maximal Independent Sets in Subcubic Graphs
• Counting maximal antichains and independent sets
• Counting and enumerating independent sets with applications to combinatorial optimization problems
• Graph-Theoretic Concepts in Computer Science
• Counting maximal independent sets in some \(n\)-gonal cacti

This page was built for publication: Counting the maximal independent sets in power set graphs

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