INGRID, a software system for assisting researchers and students of graph theory, is described. It is a partial commutative rule-based system using forward chaining, consists of approximately 1200 production rules, and is written in Berkeley Pascal on a VAX 11/780 under UNIX. INGRID has a data base of 36 graphical invariants and approximately 350 theorems symbolically relating these invariants. A set of one or more user-supplied restrictions upon the values of some invariants is propagated by INGRID, via the theorems, into intervals of possible values for other of the invariants. With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 16 articles , 1 standard article )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Larson, C. E.; Van Cleemput, N.: Automated conjecturing. III. Property-relations conjectures (2017)
  2. Larson, C. E.; Van Cleemput, N.: Automated conjecturing. I: Fajtlowicz’s Dalmatian heuristic revisited (2016)
  3. Aouchiche, M.; Hansen, P.: A survey of automated conjectures in spectral graph theory (2010)
  4. Hansen, Pierre; Lucas, Claire: Bounds and conjectures for the signless Laplacian index of graphs (2010)
  5. Christophe, Julie; Dewez, Sophie; Doignon, Jean-Paul; Fasbender, Gilles; Grégoire, Philippe; Huygens, David; Labbé, Martine; Elloumi, Sourour; Mélot, Hadrien; Yaman, Hande: Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships (2008)
  6. Gernert, Dieter; Rabern, Landon: A knowledge-based system for graph theory demonstrated by partial proofs for graph-colouring problems (2007)
  7. Brankov, V.; Hansen, P.; Stevanović, D.: Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (2006)
  8. Hansen, Pierre; Aouchiche, Mustapha; Caporossi, Gilles; Mélot, Hadrien; Stevanović, Dragan: What forms do interesting conjectures have in graph theory? (2005)
  9. Hansen, Pierre; Mélot, Hadrien: Computers and discovery in algebraic graph theory (2002)
  10. Evans, D. J.; Lambert, A.; Milne, A. M.; Taylor, S.: A study of transmission and reflection characteristics of an aircraft antenna using INGRID (1998)
  11. Hansen, Pierre; Zheng, Maolin: Sharp bounds on the order, size, and stability number of graphs (1993)
  12. Alavi, Yousef; Liu, Jiuqiang; McCanna, Joseph; Erdős, Paul: On the minimum size of graphs with a given bandwidth (1992)
  13. Brigham, Robert C.; Dutton, Ronald D.: A compilation of relations between graph invariants. Supplement I (1991)
  14. Dutton, Ronald D.; Brigham, Robert C.; Gomez, Fernando: INGRID: A graph invariant manipulator (1989)
  15. Brigham, Robert C.; Dutton, Ronald D.: Upper bounds on the edge clique cover number of a graph (1984)
  16. Dutton, Ronald D.; Brigham, Robert C.: INGRID: A software tool for extremal graph theory research (1983)