Optimization and highly informative graph invariants

MaRDI QIDQ3070753zbMATH OpenFDO

Authors Mirajana Čangalović, Dragoš Cvetković, Vera Kovačević-Vujčić

Publication date 26 January 2011

zbMATH Keywords

algebraic connectivitybranch-and-bound methodsclustering problemscomplexity indicesgraph isomorphism problemgraph spectrasemidefinite programmingtravelling salesman problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Semidefinite programming (90C22) Programming involving graphs or networks (90C35)

Recommendations

• Convex graph invariants
• Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
• scientific article; zbMATH DE number 1873286
• On the power of combinatorial and spectral invariants
• Relaxations of combinatorial problems via association schemes

Cited in

(4)

• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Directed in-out graphs of optimal size
• Almost borderenergetic line graphs
• A survey of automated conjectures in spectral graph theory

Describes a project that uses

Uses Software

• CSDP

This page was built for publication: Optimization and highly informative graph invariants

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