Linear Operators That Preserve the Genus of a Graph

A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of genus k and not on one of genus k− 1. A mapping of the set of graphs on n vertices to itself is called a linear operator if the image of a union of graphs is the union of their images and if it maps the edgeless graph to the edgeless graph. We investigate linear operators on the set of graphs on n vertices that map graphs of genus k to graphs of genus k and graphs of genus k + 1 to graphs of genus k + 1. We show that such linear operators are necessarily vertex permutations. Similar results with different restrictions on the genus k preserving operators give the same conclusion.


Introduction
Let G n denote the set of all simple graphs on the vertex set {v 1 , v 2 , • • • , v n }, so that all of our graphs are loopless and determined by their edge set.An operator (mapping) on G n is said to be linear if it preserves unions (i.e., T(G ∪ H) = T(G) ∪ T(H)), and fixes the empty graph, K n , in G n .
Such operators were considered by Hershkowitz [1] in 1987 and by Pullman [2] in 1985.Linear operators preserving the clique covering number were investigated in [2] and linear operators preserving maximum cycle length were investigated in [1].Linear operators preserving planarity and chromatic number were investigated in [3].
In this article, we show that if a linear operator T : G n → G n preserves the set of graphs of genus k, and also preserves the set of graphs of genus k + 1, then T is a vertex permutation, that is, there is a permutation, τ, of {1, 2, • • • , n} such that for all indices, i = j, if v i v j is an edge of G then v τ(i) v τ(j) is an edge of T(G).Other similar results are presented.

Notation, Definitions and Preliminary Results
Let G n denote the set of all simple graphs on the vertex set {v 1 , v 2 , • • • , v n } so that the union of two graphs is the union of their edge sets.The properties we are investigating are not affected by isolated vertices.Therefore, we can think of each nonempty graph, G, in terms of Ĝ, the subgraph of G obtained by deleting its isolated vertices.We adopt the convention that "G has a property" means " Ĝ has that property".So that if we say that "G is a 4-cycle", we mean that " Ĝ is a 4-cycle".Also, "E is an edge" means that Ê = K 2 .If E is the graph whose edge set consists only of the edge v i v j , denote E by E i,j .By an abuse of language we say that E i,j (which is a graph) is an edge of G meaning that v i v j is an edge of G.
A linear operator T : G n → G n is a vertex permutation if there is a permutation, τ, of {1, 2, • • • , n} such that for all indices, i = j, if v i v j is an edge of G then v τ (i)v τ (j) is an edge of T(G), or equivalently, for all i = j, T(E i,j ) = E τ(i),τ(j) . ( When mapping monoids whose addition is union, such as in G n , if T maps the whole monoid to a single element, then T preserves any set that contains that element, thus, in this case, to seriously investigate any set of preservers, additional conditions must be placed on the operator.See Example 1. We say that an operator preserves a set X if A ∈ X implies that T(A) ∈ X .The operator strongly preserves the set Thus, "T strongly preserves the set X " is equivalent to saying "T preserves the set X and T preserves the complement G n \X ".
Example 1.Let T : G 10 → G 10 be defined by T(X) = P for all X = K where P is the Petersen graph, and T(K) = K.Then T is linear and preserves 3-regular graphs since P is 3-regular, but T maps every graph to a 3-regular graph except K. Clearly T does not strongly preserve any set except G n .
Let f be a function on G n .We say that T preserves f if T preserves the set {X ∈ G n | f (X) = r} for each r in the image of f .That is T preserves f if and only if, for each r in the image of f , T (strongly) preserves f −1 (r). ( Let ε(G) denote the number of edges in G, that is, ε(G) = |E(G)| where |X| denotes the cardinality of the set X. A graph consisting of k edges sharing a common vertex is called a k-star.Note that a 2-star is also a path of two edges.
The following lemma appeared in [3], we include the proof for completeness.
2) If T is a bijective linear operator on G n that preserves the set of 2-stars, then T is a vertex permutation.
Proof.Suppose that T is bijective, then since G n is finite, by the nature of the addition, that being union, T maps edges to edges and preserves ε.Suppose that T preserves 2-stars, then it follows that T preserves Suppose that i and j are distinct indices so that E i,j is an edge of S i .Then, . Then, by Equation (1), T is a vertex permutation.
If G and H are graphs in G n and the edge set of G is contained in the edge set of H, that is E(G) ⊆ E(H), we write G H. In this case we say that H dominates G or G is dominated by H.
The genus of a surface, (an orientable smooth surface) is zero if it is a plane or sphere.A surface of genus one is equivalent to a sphere with one "handle", or a torus.The genus of an orientable smooth surface is k if it is equivalent to a sphere with k "handles", or a surface with k holes.
The genus of a graph is the genus of the simplest surface in which it can be embedded (drawn) with no crossings of edges.It is well known that the genus of a graph is zero (i.e., planar) if it is not a subdivision of a K 5 , the complete graph on five vertices, or a K 3,3 , the complete bipartite graph whose bipartition consists of two sets each of three members.Let γ(G) denote the genus of G for any G ∈ G n .That is γ is a function γ : G n → N, where N is the set of nonnegative integers such that γ(G) = k if k is the genus of G.
If a graph has genus k then the addition of any edge will at most increase the genus by one, since at most one "handle" must be added to the surface to embed the edge.For more on the genus of a graph and embedding, see [4].or one of the mathematical web sites such as http://en.wikipedia.org/wiki/Graph_theory, or http://mathworld.wolfram.com/GraphTheory.html.

Genus Preservers
Let k be a nonnegative integer, and let T : G n → G n be a linear operator that preserves genus k, and that preserves genus k + 1.Since n is finite, G n is finite, so there is an integer d such that L = T d is idempotent.Then, L being a power of T also preserves both genus k and genus k + 1.
Lemma 2. L is the identity operator on G n .
Proof.Since L is linear, L(K) = K.Suppose that L(X) = K and E is an edge, E X.Then, by the linearity of L, L(E) = K.Choose a graph Z whose genus is k + 1 and dominates E, and such that the genus of Z \ E is k.This is always possible, since given any graph of genus k + 1, delete edges until arriving at a graph of genus k.Permute vertices so that the last edge deleted is the edge E. But then, Suppose that E is an arbitrary edge graph.Then, ε(T(E)) ≥ 1 since T(E) = K.Suppose that F is an edge, F = E, and that F L(E).It follows that L(F) L(E) since L is idempotent.Now, let Z be a graph whose genus is k + 1 and which dominates both E and F, and such that the genus of That is, by linearity, L is the identity operator.
Proof.Recall that L = T d is the identity.We may assume that d > 1 in the definition, for if p = 1, by Lemma 2 T is the identity and the lemma follows.Equation ( 4) implies that Suppose that E is an edge and S = T(E).Then Lemma 2 implies that T d−1 (S) = L(E) = E. Let F be any edge dominated by S. Then T d−1 (F) = E, so T(E) = L(F) = F, by Lemma 2. We now have that T maps edge graphs to edge graphs in G n .
Suppose that for some edges E and F that T(E) = T(F).Then T d (E) = T d (F), and hence, E = F by Lemma 2. Thus T is bijective on the set of edge graphs of G n and by the linearity of T, T is bijective on G n .
By the finiteness of G n , we have Corollary 1. T −1 exists and preserves genus k and genus k + 1.
We now define a function that gives the minimum n such that G n has a vertex of genus k.That is, let ϕ : N → N such that n = ϕ(k) if and only if G n contains a graph of genus k and G n−1 does not.For example, ϕ(1) = 5 since K 5 has genus 1 and every graph on four vertices is planar.
From [5] we have Lemma 4. [5]  Proof.If T is a vertex permutation, then T is bijective and preserves genus k since the genus of a graph is independent of the labeling of the vertices.If k = 0, the lemma follows from Lemma 4 since G n is a finite set.If k = 1, then T strongly preserves the set of planar graphs since T is bijective and if the image of a planar graph (genus 0) is not planar it must have genus at least 2. But by adding edges to the planar graph we get a graph of genus 1 mapped to a graph of genus at least 2, a contradiction.Thus the lemma again follows from Lemma 4.
Suppose that T is bijective and preserves genus k.Due to the nature of the addition, that being union, T preserves the set of edges.That is, T maps edges to edges and is bijective on that set.
Suppose that T maps a pair of parallel edges, say E and F, to a 2-star.Then there is an edge Q such that E ∪ F ∪ Q is a graph of three edges, at least two of which are parallel, and T(E ∪ F ∪ Q) is a 3-cycle.For notational convenience and without loss of generality we may assume that T(Q) is the edge {v 1 , v 2 }, T(F) is the edge {v 2 , v 3 }, and T(E) is the edge {v 1 , v 3 }.Let Q be the edge {u, w}.
Let H be a graph of genus k − 1 on n − 8 vertices that dominates edge Q and neither edge E nor F. By appending a K 5 at each of the vertices u and w we may assume that E is an edge in one of the K 5 's and F is an edge in the other.Call this graph G. Since appending the two K 5 's adds four vertices each to the graph, G ∈ G n .Let Z = G \ (E ∪ F).Then the genus of Z is k − 1, the genus of Z ∪ E is k, as is the genus of Z ∪ F, and the genus of G = Z ∪ E ∪ F is k + 1.Further, because T strongly preserves genus k, we can deduce that the genus of T(Z) is at most k − 1, the genus of T(Z ∪ E) is k and the genus of T(G) is at least k + 1.In fact, since the addition of a single edge can increase the genus by at most one, we have that the genus of T(Z) is k − 1 and the genus of T(G) is k + 1.
Embed the graph T(Z) in a surface of genus k − 1.Thus, the edge T(Q) is drawn on this surface, append a handle on the surface that goes from any face adjacent to the vertex v 3 to a face adjacent to vertex v 1 and vertex v 2 , and to the edge T(Q).Use this handle to draw the edge T(F) without edge crossings from vertex v 2 to vertex v 3 .On this surface (of genus k) draw the edge T(E) by beginning at vertex v 1 , proceed parallel to the edge T(Q) in the face that the new handle was inserted to the handle then parallel to the edge T(F) (on the handle) to vertex v 3 .Drawing this edge does not require crossing any edge.Thus, we have embedded T(G) in a surface of genus k, a contradiction since the genus of T(G) is k + 1 and T −1 preserves genus k by Corollary 1.Thus, T maps parallel pairs to parallel pairs, or equivalently, since T is bijective, T maps 2-stars to 2-stars.
(Corollary 4.1) Let k be a nonnegative integer.Let n ≥ 6 if k = 0 or 1, and n ≥ 8 + ϕ(k − 1) if k ≥ 2.Then, T : G n → G n is a linear operator that strongly preserves genus k if and only if T is a vertex permutation.Let k be a nonnegative integer.If k = 0 or 1, let n ≥ 6 and for k ≥ 2 let n ≥ 8 + ϕ(k − 1).Then T is bijective and preserves genus k if and only if T is a vertex permutation,