Trees with given stability number and minimum number of stable sets

DOI10.1007/s00373-011-1041-2zbMath1256.05161arXiv1002.1270OpenAlexW1965834136MaRDI QIDQ1926055

Véronique Bruyère, Hadrien Mélot, Gwenaël Joret

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1270

zbMATH Keywords

stability numberFibonacci numberMerrifield-Simmons index

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Maximizing the number of independent sets of fixed size in connected graphs with given independence number

Uses Software

• GraPHedron

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
• Unicycle graphs with extremal Merrifield-Simmons index
• The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices
• Facet defining inequalities among graph invariants: The system graphedron
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• Tricyclic graphs with maximum Merrifield-Simmons index
• The number of independent sets in unicyclic graphs with a given diameter
• Fibonacci index and stability number of graphs: a polyhedral study
• Graphs, partitions and Fibonacci numbers
• Bounds on the number of vertex independent sets in a graph
• The number of independent sets in unicyclic graphs
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Maximizing the number of independent subsets over trees with bounded degree