Quasi-tree graphs with the largest number of maximal independent sets.

MaRDI QIDQ3114992zbMATH OpenFDO

Authors Jenq-Jong Lin

Publication date 20 February 2012

zbMATH Keywords

maximal independent setquasi-tree graphquasi-forest

Mathematics Subject Classification ID

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

Recommendations

• Quasi-tree graphs with the second largest number of maximal independent sets
• Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets
• The largest number of maximal independent sets in quasi-unicyclic graphs
• Trees with the second largest number of maximal independent sets
• The number of maximal independent sets in trees and forests.

Cited in

(3)

• The largest number of maximal independent sets in quasi-unicyclic graphs
• Quasi-tree graphs with the second largest number of maximal independent sets
• Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets

This page was built for publication: Quasi-tree graphs with the largest number of maximal independent sets.

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