Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
From MaRDI portal
Publication:967410
DOI10.1016/j.dam.2009.04.004zbMath1227.05169OpenAlexW1985281184MaRDI QIDQ967410
Pierre Hansen, Odile Favaron, Mustapha Aouchiche
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.004
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the Cucker-Smale ensemble with \(q\)-closest neighbors under time-delayed communications, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, Variable neighbourhood search: methods and applications, Open problems on graph eigenvalues studied with AutoGraphiX, Emergent Behaviors of the Kuramoto Model with a Time Delay on a General Digraph, Irredundance, Variable neighbourhood search: Methods and applications
Uses Software
Cites Work
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Two relations between the parameters of independence and irredundance
- On the product of upper irredundance numbers of a graph and its complement
- Contributions to the theory of domination, independence and irredundance in graphs
- Gallai-type theorems and domination parameters
- Independence and upper irredundance in claw-free graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- AutoGraphiX: a survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
