The Euler characteristic of a graph.
The Euler characteristic $\chi$ of a topological space is the alternating sum of the dimensions of the homology groups
$$\chi(X) = \sum_{k \geq 0} (-1)^k \dim H_k(X).$$
For a finite simplicial complex, this is equal to the alternating sum $ \sum_{k\geq 0} (-1)^k f_k$ where $f_k$ the number of $k$-dimensional simplices. A (simple) graph is a simplicial complex of dimension at most one; its vertices are the 0-simplices and its edges are the 1-simplices.
For a connected graph, the Euler characteristic is equal to $1 - g$ where $g$ is the cyclomatic number.

The de-duplicate of a graph.
Let $G = (V, E)$ be a graph. This map yields the graph whose vertex set is the set of (distinct) neighbourhoods $\{N_v | v \in V\}$ of $G$, and has an edge $(N_a, N_b)$ between two vertices if and only if $(a, b)$ is an edge of $G$. This is well-defined, because if $N_a = N_c$ and $N_b = N_d$, then $(a, b)\in E$ if and only if $(c, d)\in E$.
The image of this map is the set of so-called 'mating graphs' or 'point-determining graphs'.
This map preserves the chromatic number.

Adds a disconnected vertex to a graph.