The second largest number of maximal independent sets in connected graphs with at most one cycle

DOI10.1007/s10878-011-9376-4zbMath1261.90076OpenAlexW1963654174MaRDI QIDQ1928530

Min-Jen Jou

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9376-4

zbMATH Keywords

cyclemaximal independent setclasp

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Independent sets in graphs

Uses Software

• CLIP

Cites Work

• Graphs with the second largest number of maximal independent sets
• Trees with the second largest number of maximal independent sets
• Binomial-combinatorial properties of Clar structures
• Maximal independent sets in graphs with at most one cycle
• Graphs, partitions and Fibonacci numbers
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The second largest number of maximal independent sets in connected graphs with at most one cycle