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

DOI10.1002/NET.20250MaRDI QIDQ3548730zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Facet defining inequalities among graph invariants: The system graphedron
• Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
• A compilation of relations between graph invariants—supplement I
• Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
• Optimization and highly informative graph invariants

Cites work

• scientific article; zbMATH DE number 4173028 (Why is no real title available?)
• scientific article; zbMATH DE number 4173029 (Why is no real title available?)
• scientific article; zbMATH DE number 4191740 (Why is no real title available?)
• scientific article; zbMATH DE number 3849229 (Why is no real title available?)
• scientific article; zbMATH DE number 3906548 (Why is no real title available?)
• scientific article; zbMATH DE number 4081618 (Why is no real title available?)
• scientific article; zbMATH DE number 1743972 (Why is no real title available?)
• scientific article; zbMATH DE number 1409213 (Why is no real title available?)
• A compilation of relations between graph invariants
• A compilation of relations between graph invariants—supplement I
• A note on the irregularity of graphs
• Computers and discovery in algebraic graph theory
• Facet defining inequalities among graph invariants: The system graphedron
• How good are convex hull algorithms?
• On conjectures of Graffiti
• On the independence number of a graph in terms of order and size
• Turán's theorem and k‐connected graphs
• Variable neighborhood search for extremal graphs 3
• Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures

Cited in

(11)

• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
• A graph-theoretic algorithm for constructing a committee of an inconsistent system of linear inequalities
• On the sum of independence number and average degree of a graph
• Automated conjecturing. III. Property-relations conjectures
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• Fibonacci index and stability number of graphs: a polyhedral study
• The size of graphs with given feedback vertex number
• A survey of automated conjectures in spectral graph theory
• Turán Graphs, Stability Number, and Fibonacci Index
• The minimum spectral radius of graphs with a given independence number
• Facet defining inequalities among graph invariants: The system graphedron

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548730)