A compilation of relations between graph invariants
From MaRDI portal
Publication:3701468
Recommendations
Cited in
(15)- A compilation of relations between graph invariants—supplement I
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- INGRID: A graph invariant manipulator
- On nonzero component graph of vector spaces over finite fields
- Computers and discovery in algebraic graph theory
- Defining relations for deterministic graphs
- A computational approach to construct a multivariate complete graph invariant
- Topological invariance under line graph transformations
- Reverse binary graphs
- Covering arrays avoiding forbidden edges
- Domination number and neighbourhood conditions
- scientific article; zbMATH DE number 823436 (Why is no real title available?)
- A survey of automated conjectures in spectral graph theory
- On the size of graphs of a given bandwidth
This page was built for publication: A compilation of relations between graph invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701468)