INGRID: A graph invariant manipulator

DOI10.1016/S0747-7171(89)80048-3zbMath0662.05017OpenAlexW1987278626MaRDI QIDQ1113914

Ronald D. Dutton, Robert C. Brigham, Fernando Palacios Gómez

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80048-3

zbMATH Keywords

graph theorysoftware systemINGRID

Mathematics Subject Classification ID

Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ A survey of automated conjectures in spectral graph theory ⋮ Bounds and conjectures for the signless Laplacian index of graphs ⋮ Computers and discovery in algebraic graph theory

Uses Software

• INGRID

Cites Work

• MACSYMA from F to G
• A bound on the spectral radius of graphs with \(e\) edges
• The Enumeration of Locally Restricted Graphs (I)
• A compilation of relations between graph invariants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item