Jump to content

Graph invariant

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 19:34, 19 September 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In graph theory, a graph invariant is a property of a graph G, usually a number, that does not depend upon the ordering of the nodes in G.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph_invariant&oldid=5997353"