Louis Kauffman: Difference between revisions

Revision as of 20:24, 3 January 2014

Graph invariants are properties of graphs that are invariant under graph isomorphisms: each is a function $f\,$ such that $f(G_{1})=f(G_{2})\,$ whenever $G_{1}\,$ and $G_{2}\,$ are isomorphic graphs. Examples include the number of vertices and the number of edges.

@@ Line 1: / Line 1: @@
-The person who wrote the post is called Jayson Hirano and he  [http://cpacs.org/index.php?document_srl=90091&mid=board_zTGg26 best psychic readings] psychics - [http://www.khuplaza.com/dent/14869889 khuplaza.com] - totally digs that name. My spouse doesn't like it the way I do but what I truly like performing is caving but I don't have the time lately. Credit authorising is where my main earnings comes from. North Carolina is exactly where we've been living for many years and will never transfer.<br><br>My blog post - [http://www.weddingwall.com.au/groups/easy-advice-for-successful-personal-development-today/ online psychics]
+'''[[Graph invariant]]s''' are properties of [[graph (mathematics)|graph]]s that are [[invariant (mathematics)|invariant]] under [[graph isomorphism]]s: each is a function <math>f\,</math> such that <math>f(G_1)=f(G_2)\,</math> whenever <math>G_1\,</math> and <math>G_2\,</math> are isomorphic graphs. Examples include the number of vertices and the number of edges.
+[[Category:Graph theory|Invariants]]
+[[Category:Graph theory objects]]