Using size for bounding expressions of graph invariants

DOI10.1007/s10479-010-0813-zzbMath1237.05109OpenAlexW2001490112MaRDI QIDQ646725

Pierre Hansen, Jelena Sedlar, Damir Vukičević

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0813-z

zbMATH Keywords

distancesizeconnectivityextremal graphAGX

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• AutoGraphiX
• Maximum induced trees in graphs
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• On Complementary Graphs
• AutoGraphiX: a survey
• THE MAXIMUM CONNECTIVITY OF A GRAPH