Talk:Graph invariant

Difference between variant and property?

"Graph Theory" (Reinhard Diestel, 2005, Springer-Verlag) defines a graph invariant as a class of graphs that is closed under isomorphism. A graph invariant is defined as a map taking graphs as arguments which assign equal values to isomorphic graphs.

Is this an agreed-upon definition? Should the difference be noted in the article? 84.137.96.26 20:34, 3 August 2007 (UTC)[reply]

The article is a rather naive and not exactly correct. I will try to fix it in my spare time (or someone else please). `'Míkka 02:13, 4 October 2007 (UTC)[reply]