Abstract
We present PHOEG, an ecosystem of tools designed to help researchers in Extremal Graph Theory.
It uses a big relational database of undirected graphs and works with the convex hull of the graphs as points in the invariants space in order to exactly obtain the extremal graphs and optimal bounds on the invariants for some fixed parameters. The results obtained on the restricted finite class of graphs can later be used to infer conjectures. This database also allows us to make queries on those graphs. Once the conjecture defined, PHOEG goes one step further by helping in the process of designing a proof guided by successive applications of transformations from any graph to an extremal graph. To this aim, we use a second database based on a graph data model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
PHOEG stands for PHOEG Helps to Obtain Extremal Graphs.
References
Absil, R., Mélot, H.: Digenes: genetic algorithms to discover conjectures about directed and undirected graphs (2013). ArXiv preprint:1304.7993
Aouchiche, M.: Comparaison automatisée d’invariants en théorie des graphes. École polytechnique, Palaiseau (2006)
Brankov, V., Stevanovic, D.: An invitation to newgraph. In: Rendiconti del Seminario Matematico di Messina, Serie II, vol. 25, 211–216 (2003)
Caporossi, G.: Variable neighborhood search for extremal vertices: the autographix-III system. Comput. Oper. Res. 78, 431–438 (2017)
Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs: 1 the autographix system. Discret. Math. 212(1), 29–44 (2000)
Cvetkovic, D., Kraus, L., Simic, S.: Discussing Graph Theory with a Computer I. Implementation of Graph Theoretic Algorithms. University of Belgrade, Serbia (1981)
DeLaVina, E.: Graffit. PC. Graph Theory Notes of New York 42(3), 26–30 (2002)
Devillez, G., Hertz, A., Mélot, H., Hauweele, P.: Minimum eccentric connectivity index for graphs with fixed order and fixed number of pending vertices. CoRR abs/1809.03158 (2018). http://arxiv.org/abs/1809.03158
Fajtlowicz, S.: On conjectures of graffiti. Discret. Math. 72, 113–118 (1988)
Hauweele, P., Hertz, A., Mélot, H., Ries, B., Devillez, G.: Maximum eccentric connectivity index for graphs with given diameter. CoRR abs/1808.10203 (2018). http://arxiv.org/abs/1808.10203
McKay, B.D., Piperno, A.: Practical graph isomorphism, {II}. J. Symb. Comput. 60(0), 94–112 (2014). https://doi.org/10.1016/j.jsc.2013.09.003. http://www.sciencedirect.com/science/article/pii/S0747717113001193
Mélot, H.: Facet defining inequalities among graph invariants: the system graphedron. Discret. Appl. Math. 156(10), 1875–1891 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Devillez, G., Hauweele, P., Mélot, H. (2019). PHOEG Helps to Obtain Extremal Graphsch:32. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)