Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

DOI10.1016/j.dam.2008.03.011zbMath1173.05022OpenAlexW2091876458WikidataQ123302474 ScholiaQ123302474MaRDI QIDQ955318

Pierre Hansen, Gunnar Brinkmann, Mustapha Aouchiche

Publication date: 19 November 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.011

zbMATH Keywords

independence numberinvariantextremal graphAGX

Mathematics Subject Classification ID

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

Related Items

On the extremal properties of the average eccentricity, On autographix conjecture regarding domination number and average eccentricity, Proof of conjectures involving algebraic connectivity of graphs, Upper bounds on the average eccentricity, Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity, Further results regarding the sum of domination number and average eccentricity, Independent sets in graphs, Proof of conjecture involving algebraic connectivity and average degree of graphs, Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance, Variable neighbourhood search: methods and applications, Open problems on graph eigenvalues studied with AutoGraphiX, ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH, Variable neighbourhood search: Methods and applications

Uses Software

• AutoGraphiX
• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
• Maximum induced trees in graphs
• Variable neighborhood search
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• A computational attack on the conjectures of Graffiti: New counterexamples and proofs
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• A characterization of radius-critical graphs
• On Complementary Graphs
• AutoGraphiX: a survey
• The average distance and the independence number
• Variable neighborhood search: Principles and applications