A compilation of relations between graph invariants

DOI10.1002/NET.3230150108zbMATH Open0579.05059OpenAlexW2089553065MaRDI QIDQ3701468FDOQ3701468

Ronald D. Dutton, Robert Brigham

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)

Cites Work

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

Cited In (15)

• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Computers and discovery in algebraic graph theory
• Defining relations for deterministic graphs
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• A computational approach to construct a multivariate complete graph invariant
• Reverse binary graphs
• Domination number and neighbourhood conditions
• Title not available (Why is that?)
• INGRID: A graph invariant manipulator
• A compilation of relations between graph invariants—supplement I
• On nonzero component graph of vector spaces over finite fields
• Topological invariance under line graph transformations
• On the size of graphs of a given bandwidth
• Covering arrays avoiding forbidden edges
• A survey of automated conjectures in spectral graph theory

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)