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