Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships

DOI10.1002/net.20250zbMath1151.05334OpenAlexW3013552619MaRDI QIDQ3548730

Jean-Paul Doignon, Julie Christophe, Hande Yaman, David Huygens, Sourour Elloumi, Philippe Grégoire, Sophie Dewez, Hadrien Mélot, Gilles Fasbender, Martine Labbé

Publication date: 17 December 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/22943

zbMATH Keywords

polytopegraph invariantsgraphedronoptimal linear inequalities

Mathematics Subject Classification ID

Applications of graph theory (05C90)

Related Items (10)

The size of graphs with given feedback vertex number ⋮ Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ A survey of automated conjectures in spectral graph theory ⋮ ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH ⋮ The minimum spectral radius of graphs with a given independence number ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ Turán Graphs, Stability Number, and Fibonacci Index

Uses Software

• cdd
• nauty
• INGRID
• PORTA
• AutoGraphiX
• GRAFFITI
• GRAPH
• GraPHedron

Cites Work

• On conjectures of Graffiti
• Facet defining inequalities among graph invariants: The system graphedron
• A note on the irregularity of graphs
• How good are convex hull algorithms?
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Computers and discovery in algebraic graph theory
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs 3
• A compilation of relations between graph invariants
• A compilation of relations between graph invariants—supplement I
• Turán's theorem and k‐connected graphs
• On the independence number of a graph in terms of order and size
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships