A compilation of relations between graph invariants

DOI10.1002/net.3230150108zbMath0579.05059OpenAlexW2089553065MaRDI QIDQ3701468

Robert C. Brigham, Ronald D. Dutton

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230150108

zbMATH Keywords

graph invariantsBoolean invariantsinteger valued invariantsreal valued invariant

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (11)

Topological invariance under line graph transformations ⋮ INGRID: A graph invariant manipulator ⋮ On the size of graphs of a given bandwidth ⋮ On nonzero component graph of vector spaces over finite fields ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ A survey of automated conjectures in spectral graph theory ⋮ Covering arrays avoiding forbidden edges ⋮ Domination number and neighbourhood conditions ⋮ Computers and discovery in algebraic graph theory ⋮ Reverse binary graphs

Cites Work

• Heawood's theorem and connectivity
• The Representation of a Graph by Set Intersections

This page was built for publication: A compilation of relations between graph invariants