INGRID
From MaRDI portal
Software:13815
swMATH1071MaRDI QIDQ13815FDOQ13815
Author name not available (Why is that?)
Cited In (15)
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Computers and discovery in algebraic graph theory
- Sharp bounds on the order, size, and stability number of graphs
- Bounds and conjectures for the signless Laplacian index of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- INGRID: A graph invariant manipulator
- Title not available (Why is that?)
- A compilation of relations between graph invariants—supplement I
- Automated conjecturing. III. Property-relations conjectures
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Upper bounds on the edge clique cover number of a graph
- A survey of automated conjectures in spectral graph theory
- Title not available (Why is that?)
This page was built for software: INGRID
