Facet defining inequalities among graph invariants: The system GraPHedron

Discrete Applied Mathematics

Volumn 156, Issue 10, 2008, Pages 1875-1891

  Mélot, Hadrien ^a  

^a UNIVERSITY OF MONS   (Belgium)

Author keywords

Computer assisted system; Conjecture; Graph; GraPHedron

Indexed keywords

COMPUTER SYSTEMS; SET THEORY; TOPOLOGY;

(E ,2E) THEORY; CONNECTED GRAPHS; CONVEX HULLS; ELSEVIER (CO); EUCLIDIAN SPACE; FACET-DEFINING INEQUALITIES; FINITE SETS; FORMAL FRAMEWORK; GRAPH INVARIANTS; LINEAR INEQUALITIES; POLYHEDRAL APPROACH;

GRAPH THEORY;

EID: 45849083161     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.09.005     Document Type: Article

References (46)

1. Aouchiche M., Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs 8. Variations on Graffiti 105. Congr. Numer. 148 (2001) 129-144
2. Avis D., Bremner D., and Seidel R. How good are convex hull algorithms. Comput. Geom. 7 (1997) 265-301
3. Berge C. Graphes et Hypergraphes (1983), Gauthier-Villars, Paris
4. Caporossi G., Cvetković D., Gutman I., and Hansen P. Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy. J. Chem. Inform. Comput. Sci. 39 (1999) 984-996
5. Caporossi G., Gutman I., and Hansen P. Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index. Comput. Chem. 23 (1999) 469-477
6. Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discrete Math. 212 (2000) 29-44
7. Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures. Discrete Math. 276 (2004) 81-94
8. J. Cardinal, M. Labbé, S. Langerman, E. Levy, H. Mélot, A tight analysis of the maximal matching heuristic, in: Computing and Combinatorics: 11th Annual International Conference, COCOON 2005, Kunming, China, Lecture Notes in Computer Science, vol. 3595, Springer, Berlin, 2005, pp. 701-709.
9. J. Cardinal, S. Langerman, E. Levy, Improved approximation bounds for edge dominating set in dense graphs. in: Proceedings of Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, vol. 4368, Springer, Berlin, 2006, pp. 108-120.
10. J. Christophe, S. Dewez, J.-P. Doignon, S. Elloumi, G. Fasbender, P. Grégoire, D. Huygens, M. Labbé, H. Mélot, H. Yaman, Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships, submitted for publication.
11. Cvetković D. Discussing graph theory with a computer, II: theorems suggested by the computer. Publ. Inst. Math. (Beograd) 33 47 (1983) 29-33
12. Cvetković D. Discussing graph theory with a computer, IV: knowledge organisation and examples of theorem proving. Proceedings of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad (1983) 43-68
13. Cvetković D. Discussing graph theory with a computer, VI: theorems proved with the aid of the computer. Cl. Sci. Math. Natur., Sci. Math. T. XCVII 16 (1988) 51-70
14. Cvetković D., Kraus L., and Simić S. Discussing graph theory with a computer, I: implementation of graph theoretic algorithms. Univ. Beograd Publ. Elektrotehn. Fak, Ser. Mat. Fiz. No. 716-734 (1981) 100-104
15. Cvetković D., and Pevac I. Discussing graph theory with a computer, III: man-machine theorem proving. Publ. Inst. Math. (Beograd) 34 48 (1983) 37-47
16. Cvetković D., and Simić S. Graph theoretical results obtained by the support of the expert system "graph". Bull. Acad. Serbe Sci. Arts Cl. Sci. Math. Natur. 19 (1994) 19-41
17. Cvetković D., Simić S., Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees. Linear and Multilinear Algebra 2 (2001) 143-160
18. E. De la Vina, Bibliography on conjectures of Graffitti. Available at 〈http://cms.dt.uh.edu/faculty/delavinae/research/wowref.htm〉, 2000.
19. Diestel R. Graph Theory. second ed. (2000), Springer, Berlin
20. S. Fajtlowicz, Written on the wall. A regularly updated file accessible from 〈http://www.math.uh.edu/∼clarson/〉.
21. Fajtlowicz S. On conjectures of Graffiti-II. Congr. Numer. 60 (1987) 187-197
22. Fajtlowicz S. On conjectures of Graffiti. Discrete Math. 72 (1988) 113-118
23. Fajtlowicz S. On conjectures of Graffiti-III. Congr. Numer. 66 (1988) 23-32
24. Fajtlowicz S. On conjectures of Graffiti-IV. Congr. Numer. 70 (1990) 231-240
25. Fajtlowicz S. On conjectures of Graffiti-V. Seventh International Quadrennial Conference on Graph Theory vol. 1 (1995) 367-376
26. Fajtlowicz S., and Waller W.A. On two conjectures of Graffiti. Congr. Numer. 55 (1986) 51-56
27. Fowler P.W., Hansen P., Caporossi G., and Soncini A. Polyenes with Maximum HOMO-LUMO Gap. (Variable neighborhood search for extremal graphs 7). Chem. Phys. Lett. 342 (2001) 105-112
28. K. Fukuda, cdd/cdd+ reference manual. cdd ver. 0.61, cdd+ ver. 0.76, 1999, available at 〈http://www.cs.mcgill.ca/∼fukuda/soft/cddman/cddman.html〉.
29. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness (1979), Freeman and Company, New York
30. Gawrilow E., and Joswig M. Polymake: a framework for analyzing convex polytopes. In: Kalai G., and Ziegler G.M. (Eds). Polytopes-Combinatorics and Computation (2000), Birkhäuser, Basel 43-74
31. Gawrilow E., and Joswig M. Polymake: an approach to modular software design in computational geometry. Proceedings of the 17th Annual Symposium on Computational Geometry (June 3-5, 2001), ACM, Medford, MA 222-231
32. GMP. GNU multiple precision arithmetic library, Homepage: 〈http://www.swox.com/gmp/〉.
33. GraPHedron. Web portal at 〈http://www.graphedron.net〉.
34. Gutman I., Hansen P., and Mélot H. Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. J. Chem. Inform. Modeling 45 (2005) 222-230
35. Hansen P. How far should, is and could be conjecture-making automated in graph theory?. In: Fajtlowicz S., et al. (Ed). Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 69 (2005), American Mathematical Society, Providence 189-230
36. Hansen P., Aouchiche M., Caporossi G., Mélot H., and Stevanović D. What forms do interesting conjectures have in graph theory?. In: Fajtlowicz S., et al. (Ed). Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 69 (2005), American Mathematical Society, Providence 231-252
37. P. Hansen, M. Labbé, H. Mélot, Automatization of conjecture-making in GraPHedron, 2006, in preparation.
38. Hansen P., and Mélot H. Computers and discovery in algebraic graph theory. Linear Algebra Appl. 356 (2002) 211-230
39. Hansen P., and Mélot H. Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index. J. Chem. Inform. Comput. Sci. 43 (2003) 1-14
40. Hansen P., and Mélot H. Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. In: Fajtlowicz S., et al. (Ed). Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 69 (2005), American Mathematical Society, Providence 253-264
41. Hansen P., Mélot H., and Gutman I. Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs. MATCH Comm. Math. Comput. Chem. 54 (2005) 221-232
42. B.D. McKay, Nauty user's guide (version 1.5), Technical Report, Department of Computer Science, Australian National University, 1990.
43. H. Mélot, On automated and computer aided conjectures in graph theory, Ph.D. Thesis, Université de Mons-Hainaut, 2006.
44. Ore O. Theory of Graphs, American Mathematical Society Colloquium Publications vol. XXXVIII (1962), American Mathematical Society, Providence, RI
45. Turán P. Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48 (1941) 436-452
46. Ziegler G.M. Lectures on Polytopes. revised ed. (1998), Springer, Berlin