Recherche à voisinage variable de graphes extrémaux 13. À propos de la maille
RAIRO - Operations Research - Recherche Opérationnelle, Volume 39 (2005) no. 4, p. 275-293

The AutoGraphiX system (AGX1 et AGX2) allows, among other functions, automated generation of conjectures in graph theory and, in its most recent version, automated proof of simple conjectures. To illustrate these functions and the type of results obtained, we study systematically in this paper, conjectures of the form ${\underline{b}}_{n}\phantom{\rule{0.166667em}{0ex}}\le \phantom{\rule{0.166667em}{0ex}}g\phantom{\rule{0.166667em}{0ex}}\oplus \phantom{\rule{0.166667em}{0ex}}i\phantom{\rule{0.166667em}{0ex}}\le \phantom{\rule{0.166667em}{0ex}}{\overline{b}}_{n}$ where $g$ denotes the girth (or length of the smallest cycle) of a graph $G=\left(V,E\right)$, $i$ another invariant among independence number, radius,iameter, minimum, average or maximum degree, ${\underline{b}}_{n}$ and ${\overline{b}}_{n}$ best possible functions of the order $n$ of $G$, and $\oplus$ denotes one of the four operations $+,-,×,/$. 48 such conjectures are obtained: the easiest ones are proved automatically and the others by hand. Moreover 12 open and unstudied conjectures are submitted to the readers.

Le système AutoGraphiX (AGX1 et AGX2) permet, parmi d’autres fonctions, la génération automatique de conjectures en théorie des graphes et, dans une version plus récente, la preuve automatique de conjectures simples. Afin d’illustrer ces fonctions et le type de résultats obtenus, nous étudions systématiquement ici des conjectures obtenues par ce système et de la forme ${\underline{b}}_{n}\phantom{\rule{0.166667em}{0ex}}\le \phantom{\rule{0.166667em}{0ex}}g\phantom{\rule{0.166667em}{0ex}}\oplus \phantom{\rule{0.166667em}{0ex}}i\phantom{\rule{0.166667em}{0ex}}\le \phantom{\rule{0.166667em}{0ex}}{\overline{b}}_{n}$$g$ désigne la maille (ou longueur du plus petit cycle) du graphe $G=\left(V,E\right)$, $i$ un autre invariant choisi parmi le nombre de stabilité, le rayon, le diamètre, le degré minimum, moyen ou maximum, ${\underline{b}}_{n}$ et ${\overline{b}}_{n}$ des fonctions de l’ordre $n=|V|$ de $G$ les meilleures possibles, enfin $\oplus$ correspond à une des opérations $+,-,×,/$. 48 telles conjectures sont obtenues : les plus simples sont démontrées automatiquement et les autres à la main. De plus 12 autres conjectures ouvertes et non encore étudiées sont soumises aux lecteurs.

DOI : https://doi.org/10.1051/ro:2006006
Keywords: graphe, invariant, conjecture, AGX, maille
@article{RO_2005__39_4_275_0,
author = {Aouchiche, Mustapha and Hansen, Pierre},
title = {Recherche \a voisinage variable de graphes extr\'emaux 13. \A propos de la maille},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
publisher = {EDP-Sciences},
volume = {39},
number = {4},
year = {2005},
pages = {275-293},
doi = {10.1051/ro:2006006},
zbl = {1132.05032},
mrnumber = {2208754},
language = {fr},
url = {http://www.numdam.org/item/RO_2005__39_4_275_0}
}
Aouchiche, Mustapha; Hansen, Pierre. Recherche à voisinage variable de graphes extrémaux 13. À propos de la maille. RAIRO - Operations Research - Recherche Opérationnelle, Volume 39 (2005) no. 4, pp. 275-293. doi : 10.1051/ro:2006006. http://www.numdam.org/item/RO_2005__39_4_275_0/

[1] M. Aouchiche, J.-M. Bonnefoy, A. Fidahoussen, G. Caporossi, P. Hansen, L. Hiesse, J. Lacheré and A. Monhait, Variable Neighborhood Search for Extremal Graphs. 14. The AutoGraphiX 2 System. Global Optimization: From Theory to Implementation, edited by L. Liberti and N. Maculan, Springer (2005). | Zbl 1100.90052

[2] M. Aouchiche, G. Caporossi and P. Hansen, Automated Comparison of Graph Invariants. Les Cahiers du GERAD, G-2005-40, rapport technique, HEC Montréal (2005) 21 pages.

[3] S. Belhaiza, N.M.M. De Abreu, P. Hansen and C.S. Oliveira, Variable Neighborhood Search for Extremal Graphs 11. Bounds on Algebraic Connectivity, edited by D. Avis, A. Hertz and O. Marcotte, Graph Theory and Combinatorial Optimization, Dordrecht, Kluwer (2005) 1-16. | Zbl 1096.05027

[4] R. C. Brigham and R. D. Dutton, A Compilation of Relations between Graph Invariants. Networks 21 (1991) 421-455. | Zbl 0743.05057

[5] G. Caporossi, D. Cvetkovic, I. Gutman and P. Hansen, Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy. J. Chem. Inform. Comput. Sci. 39 (1999) 984-996.

[6] G. Caporossi, I. Gutman and P. Hansen, Variable Neighborhood Search for Extremal Graphs. 4. Chemical Trees with Extremal Connectivity Index. Comput. Chem. 23 (1999) 469-477.

[7] G. Caporossi and P. Hansen, Variable Neighborhood Search for Extremal Graphs. I. The AutoGraphiX System. Discrete Math. 212 (2000) 29-44. | Zbl 0947.90130

[8] G. Caporossi and P. Hansen, Variable Neighborhood Search for Extremal Graphs. V. Three Ways to Automate Finding Conjectures. Discrete Math. 276 (2004) 81-94. | Zbl 1031.05068

[9] F.R.K. Chung, The Average Distance and the Independence Number. J. Graph Theory 12 (1988) 229-235. | Zbl 0644.05029

[10] D. Cvetković, S. Simić, G. Caporossi and P. Hansen, Variable Neighborhood Search for Extremal Graphs. III. On the Largest Eigenvalue of Color-Constrained Trees. Linear Multilinear Algebra 49 (2001) 143-160. | Zbl 1003.05058

[11] D. Cvetković and S. Simić, Graph Theoretical Results Obtained by the Support of the Expert System “GRAPH” - an Extended Survey. In [13]. | Zbl 1108.05061

[12] S. Fajtlowicz, On Conjectures of Graffiti. Discrete Math. 72 (1988) 113-118. | Zbl 0711.68081

[13] Graphs and Discovery. DIMACS Series in Discrete Math. and Theoretical Computer Science, edited by S. Fajtlowicz, P. Fowler, P. Hansen, M. Janowitz and F. Roberts, Providence, AMS (2005). | MR 2193475 | Zbl 1087.05001

[14] I. Gutman, P. Hansen and H. Mélot, Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. J. Chem. Inform. Comput. Sci. (2005, to appear). | MR 2143222

[15] P. Hansen, Computers in Graph Theory. Graph Theory Notes of New York 43 (2002) 20-34.

[16] P. Hansen, How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process ? In [13]. | Zbl 1097.68588

[17] P. Hansen and H. Mélot, Variable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity Index. J. Chem. Inform. Comput. Sci. 43 (2003) 1-14.

[18] P. Hansen and H. Mélot, Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. In [13]. | Zbl 1095.05019

[19] P. Hansen and N. Mladenović, Variable Neighborhood Search: Principles and Applications. Eur. J. Oper. Res. 130 (2001) 449-467. | Zbl 0981.90063

[20] N. Mladenović and P. Hansen, Variable Neighborhood Search. Comput. Oper. Res. 24 (1997) 1097-1100. | Zbl 0889.90119

[21] E.A. Nordhaus and J.W. Gaddum, On Complementary Graphs. Amer. Math. Monthly 63 (1956) 175-177. | Zbl 0070.18503

[22] B.A. Smith, Private communication (2004).

[23] P. Turán, Eine Extremalaufgabe aus der Graphentheorie. (Hungarian) Mat. Fiz. Lapok 48 (1941) 436-452. | Zbl 0026.26903

[24] Written on the wall. Electronic file available from http://math.uh.edu/~clarson/ (1999).