Turán Graphs, Stability Number, and Fibonacci Index

DOI10.1007/978-3-540-85097-7_12zbMath1168.05316arXiv0802.3284OpenAlexW1810692045MaRDI QIDQ5505651

Véronique Bruyère, Hadrien Mélot

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Independent sets in graphs ⋮ Fibonacci index and stability number of graphs: a polyhedral study

Cites Work

• Enumerating maximal independent sets with applications to graph colouring.
• 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
• Graphs, partitions and Fibonacci numbers
• Bounds on the number of vertex independent sets in a graph
• The number of independent sets in unicyclic graphs
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Extremal Problems for Topological Indices in Combinatorial Chemistry
• Turán's theorem and k‐connected graphs
• Maximizing the number of independent subsets over trees with bounded degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turán Graphs, Stability Number, and Fibonacci Index