Next Article in Journal
Rational Transformations for Evaluating Singular Integrals by the Gauss Quadrature Rule
Next Article in Special Issue
Endomorphism Spectra of Double Fan Graphs
Previous Article in Journal
Soft Open Bases and a Novel Construction of Soft Topologies from Bases for Topologies
Previous Article in Special Issue
Homomorphic Image and Inverse Image of Weak Closure Operations on Ideals of BCK-Algebras
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Operators That Preserve Two Genera of a Graph

1
Department of Mathematics and Statistics, Utah State University, Logan, UT 84322-3900, USA
2
Department of Mathematics, Jeju National University, Jeju 63243, Korea
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(5), 676; https://doi.org/10.3390/math8050676
Submission received: 21 March 2020 / Revised: 27 April 2020 / Accepted: 28 April 2020 / Published: 30 April 2020
(This article belongs to the Special Issue Algebra and Discrete Mathematics 2020)

Abstract

:
If a graph can be embedded in a smooth orientable surface of genus g without edge crossings and can not be embedded on one of genus g 1 without edge crossings, then we say that the graph has genus g. We consider a mapping on the set of graphs with m vertices into itself. The mapping is called a linear operator if it preserves a union of graphs and it also preserves the empty graph. On the set of graphs with m vertices, we consider and investigate those linear operators which map graphs of genus g to graphs of genus g and graphs of genus g + j to graphs of genus g + j for j g and m sufficiently large. We show that such linear operators are necessarily vertex permutations.
MSC:
05C05; 15A04; 15A86

1. Introduction

Let G n denote the set of all simple loopless graphs on n vertices. Determining whether a graph belongs to some specified set is sometimes difficult. For example, finding the genus of a graph is an NP-hard problem. A good method of finding families of graphs of a specific genus is to consider operators on known families of graphs of specific genus.
A mapping T on G n is called a linear operator if it preserves the unions (that is, T ( G 1 G 2 ) = T ( G 1 ) T ( G 2 ) for any graphs G 1 and G 2 ), and preserves the edgeless graph, K n ¯ , in G n .
Such linear operators were studied by Pullman [1] in 1985 and by Hershkowitz [2] in 1987. Those mappings that preserve the clique covering number were studied in [1] and the mappings that preserve maximum cycle length were studied in [2]. The mappings that preserve chromatic number and planarity were studied in [3].
For a graph G, let V ( G ) denote the vertex set and E ( G ) denote the edge set so that an edge in E ( G ) is represented by an unordered pair of vertices, { u , v } , or simply u v . Isolated vertices does not affect the properties that we are investigating. So, we may think of nonempty subgraph G ^ of G, which is obtained by deleting its isolated vertices from G. We now adopt the convention that “G has a property” means “ G ^ has that property”. Therefore if we say that “E is an edge” means that E ^ = K 2 and if we say that “G is a 3-cycle”, we mean that “ G ^ is a 3-cycle”.
Let the vertex set of the graphs in G n be { v 1 , v 2 , , v n } . If the edge set of a graph E consists only of the edge v i v j , we denote E by E i , j . A linear operator T : G n G n is called a vertex permutation ([2]) if there is a permutation, τ , of { 1 , 2 , , n } such that if v i v j is an edge of G, i j , then v τ ( i ) v τ ( j ) is an edge of T ( G ) , which is equivalent to
T ( E i , j ) = E τ ( i ) , τ ( j ) ,
for all i j .
We say that a linear operator T preserves a set S if X S implies that T ( X ) S . The linear operator T strongly preserves the set S if
X S if and only if T ( X ) S .
Thus, “T strongly preserves the set S ” means that “T preserves the set S and T preserves the complement G n \ S ”.
If T : G n G n is a linear operator that maps the whole set G n to a single element, then T preserves any set that contains that single element. So, for our investigation, additional conditions must be added to the linear operator as we see in the following example.
Example 1.
Let P be the Petersen graph, Then P is a 3-regular graph. Let T : G 10 G 10 be defined by T ( A ) = P for all A K ¯ and T ( K ¯ ) = K ¯ . Then T is a linear operator and preserves 3-regular graphs, but T maps every graph A except K ¯ to the 3-regular graph P . Therefore T strongly preserves no set of graphs except P and K ¯ .
Let h be a function on G n and T : G n G n be a linear operator. The operator T is said to preserve the function h if T preserves the set { A G n | h ( A ) = k } for each k h ( G n ) , the image of h. This is equivalent that
T preserves h if and only if , for each k h ( G n ) , T strongly preserves h 1 ( k ) .
Let ε ( G ) denote the number of edges in G, i.e., ε ( G ) = | E ( G ) | , the cardinality of the set E ( G ) . We say that a graph G is a k-star ([3]) if G is consisted of k edges sharing a common vertex. Then a 2-star is a path of two connected edges.
Let G and H be graphs in G n and E ( G ) E ( H ) . Then we say that G is dominated by H or H dominates G, and we denote G H .
We say that the genus of a surface is 0 when the surface is a sphere or a plane. A surface has genus 1 if it is equivalent to a torus or a sphere with 1 “handle”. An orientable smooth surface has genus k if it is equivalent to a surface with k holes, or a sphere with k “handles”.
The genus of a graph is defined as the genus of the simplest surface in which it can be embedded (drawn) without crossings of edges. There are well known facts such that the genus of a graph is 0 (i.e., the surface is planar) if it is not a subdivision of a K 5 or K 3 , 3 , where K 5 is the complete graph on 5 vertices, and K 3 , 3 is the complete bipartite graph the vertex bipartition being two sets each of three members.
For G G n , let us denote the genus of G by γ ( G ) . Thus, γ is a function γ : G n Z + , the set of nonnegative integers, which is defined by γ ( G ) = h if G has genus h.
For a graph G with γ ( G ) = h , if we add any edge E to G then G E will have genus at most h + 1 , since at most one “handle” should be attached to the surface to embed the edge. For more known facts on the genus of a graph and embedding, we refer [4] or the following mathematical web sites:http://mathworld.wolfram.com/GraphTheory.html. https://en.wikipedia.org/wiki/Graph_theory.
Now, we define a function φ on the set of natural integers N , such that G n has a graph G with γ ( G ) = h . That is, define φ : N N by φ ( h ) = n if and only if G n contains a graph G with γ ( G ) = h and G n 1 does not. As an example, φ ( 1 ) = 5 since complete graph K 5 has genus 1 and each graph on four vertices has genus 0. That is, φ ( h ) gives the minimum n N such that G n has a graph G with γ ( G ) = h . Also, extending this function φ to the nonnegative integers, we define φ ( K n ¯ ) = 0 .
In [5] the following theorem was established:
Theorem 1.
([5] Theorem 3.7). For a nonnegative integer h, let n 6 if h = 0 or 1 , and n 8 + φ ( h 1 ) if h 2 . If T : G n G n is a linear operator, then, the following are eqivalent:
1. 
T preserves consecutive two genera h and h + 1 ;
2. 
T strongly preserves genus h;
3. 
T preserves genus h and is bijective;
4. 
T preserves genus h and T ( K n ) = K n ;
5. 
T maps edges to edges and T preserves genus h for h 1 ;
6. 
T is a vertex permutation.
In this article, we extend these results. The following join of two graphs will be used.
Definition 1.
Let u , v , and w be vertices. Let G G q , H G r , V ( G ) V ( H ) = , u V ( G ) , v V ( H ) , and w V ( G ) V ( H ) . Define the ( u , v ) -append ofGandH, G u v H , to be the graph on r + q 1 vertices whose vertex set is ( V ( G ) \ { u } ) ( V ( H ) \ { v } ) { w } and let the edge set of G u v H to be the set { x y | x y E ( G ) , x , y u } { x y | x y E ( H ) , x , y v } { x w | x u E ( G ) } { x w | x v E ( H ) } . See Figure 1. If the vertex u in G is not specified, that is the choice of vertex u is arbitrary, we write G v H or H v G , and if neither is specified we write G H .
For example, if G is a graph one of whose vertices is v we write K 4 v G since any choice of a vertex from K 4 will give the same graph appended to the vertex v of G. Similarly, if C 6 is a 6 cycle, we write K 4 C 6 , since for any choices of vertices of K 4 and any choice of vertices of C 6 give the same appended graph. Further, when appending more than two graphs, we use a sequence of vertices w 1 , w 2 , so that for v 1 G 1 , v 2 , u 2 G 2 , etc., the graph G 1 v 1 u 2 G 2 v 2 u 3 G 3 is well defined. In Figure 2, we show the appending of two K 4 ’s to the ends of an edge E.

2. A Construction

We define the box-sum of graphs K 5 F where F is a forest. We assume that the number n of vertices in G n is at least four times the number of edges in the forest plus the number of components of F.
We begin defining K 5 H where H is a tree as follows: Let H be a tree with nonisolated vertex set { v 1 , v 2 , , v q + 1 } and with q edges, E i = { u 1 ( i ) u 2 ( i ) } , i = 1 , , q , where u 1 ( i ) , u 2 ( i ) { v 1 , v 2 , , v q + 1 } . To each edge E i = u 1 ( i ) u 2 ( i ) , of H assign the vertices w 1 ( i ) , w 2 ( i ) , w 3 ( i ) { v q + 2 , v q + 3 , , v n } and such that for i j ,
{ w 1 ( i ) , w 2 ( i ) , w 3 ( i ) } { w 1 ( j ) , w 2 ( j ) , w 3 ( j ) } = .
Let K 5 ( i ) be the complete graph induced by the set of vertices
{ u 1 ( i ) u 2 ( i ) , w 1 ( i ) , w 2 ( i ) , w 3 ( i ) } .
Let K 5 H = i = 1 q K 5 ( i ) . Then, K 5 H is a graph on 4 ε ( H ) + 1 vertices such that
  • H is a subgraph of K 5 H ;
  • K 5 H contains q blocks;
  • each block is isomorphic to K 5 ; and
  • exactly one edge of H is dominated by each block of K 5 H .
Let F = H 1 H be a forest with disjoint trees H 1 , , H . Let { v 1 , v 2 , , v s } be the set of nonisolated vertices of F, and let F have a total of r edges, E i = { u 1 ( i ) u 2 ( i ) } , i = 1 , , r , where u 1 ( i ) , u 2 ( i ) { v 1 , v 2 , , v s } .
Let { w 1 ( i ) , w 2 ( i ) , w 3 ( i ) | i = 1 , , r } be a set of vertices in { v s + 1 , , v n } such that
{ w 1 ( i ) , w 2 ( i ) , w 3 ( i ) } { w 1 ( j ) , w 2 ( j ) , w 3 ( j ) } = .
Let K 5 ( i ) be the complete graph induced by the set of vertices
{ u 1 ( i ) u 2 ( i ) , w 1 ( i ) , w 2 ( i ) , w 3 ( i ) } .
Let
K 5 F 1 = i = 1 r K 5 ( i ) = i = 1 l K 5 H i .
Then K 5 F is a graph such that
  • F is a subgraph of K 5 F ;
  • K 5 F contains components and a total of ε ( H 1 ) + ε ( H 2 ) + + ε ( H ) (= s) blocks;
  • the ith component of K 5 F is K 5 H i ;
  • exactly one edge of F is dominated by each block of each component of K 5 F ;
  • The genus of K 5 F is s, the number of edges in F.
Note that K 5 F is not unique, it depends on the choice of vertices w ( 1 ) , w ( 2 ) , , w ( 1 ) and v ( 2 ) , v ( 3 ) , , v ( ) .
Example 2.
In Figure 3 we see a tree H and in Figure 4 we see the graph K 5 H with the bold edges indicating the original tree H.

3. Linear Operators That Preserve Two Genera of a Graph

Let X be a subset of G n and let X = X X X . So that ker ( T ) is the largest graph in ker ( T ) . Let ε ( G ) = | E ( G ) | , the number of edges in the graph G and let E be the set of all edge graphs in G n .
Let T : G n G n be a linear operator.
  • Let N ( T ) = ker ( T ) E . Let N ( T ) = ker ( T ) and let F N ( T ) be a spanning forest of N ( T ) .
  • Let W ( T ) = { E E | F E E T ( F ) } , W ( T ) = W and F W ( T ) be a spanning forest of W ( T ) .
  • Let U ( T ) = N ( T ) W ( T ) , U ( T ) = N ( T ) W ( T ) and F U ( T ) be a spanning forest of U ( T ) .
In the following lemma we shall use the function φ : N N defined above Theorem 1 such that φ ( h ) gives the minimum n N such that G n has a graph G with γ ( G ) = h . Further recall that an idempotent operator, L, is one for which L 2 = L .
Lemma 1.
Let k and j be positive integers and let n 4 j + φ ( k ) . Let L : G n G n be an idempotent linear operator that preserves the set of graphs of genus k and the set of graphs of genus k + j . Then, ε ( F U ( L ) ) < j .
Proof. 
Suppose that ε ( F U ( L ) ) j . Let F U ( L ) = E 1 E 2 E ε ( F u ( L ) ) where each E i is an edge, and label the edges so that E 1 E W ( L ) and E + 1 E ε ( F U ( L ) ) N ( L ) . Further, for E W ( L ) , since L is idempotent and E L ( F ) , L ( E ) L 2 ( F ) = L ( F ) .
Let F ˜ = E 1 E 2 E j , and consider K 5 F ˜ . Then, K 5 F ˜ has genus j, and meets 4 j + 1 vertices. Let Q be a graph of genus k on n 4 j vertices and let G = ( K 5 F ˜ ) Q . G meets all the vertices of K 5 F ˜ ( 4 j + 1 vertices ) and all the vertices of Q ( n 4 j vertices ) . Since in G, ( K 5 F ˜ ) and Q share one vertex, G meets n vertices. Then γ ( G ) = k + j and γ ( G \ ( E 1 E 2 E j ) ) = k since the deletion of each edge in F ˜ reduces the genus of ( K 5 F ˜ ) by one and hence reduces the genus of G by one. Let F i , i = 1 , , be edges dominated by G such that E i L ( F i ) .
Now, G = [ G \ ( E 1 E 2 E j ) ] ( E 1 E 2 E j ) = [ G \ ( E 1 E 2 E j ) ] ( E 1 E 2 E j ) ( F 1 F ) , since G \ ( E 1 E 2 E j ) ( F 1 F ) . Thus G \ ( E 1 E 2 E j ) = [ G \ ( E 1 E 2 E j ) ] ( F 1 F ) . So
L ( G ) = L ( [ G \ ( E 1 E 2 E j ) ] ( E 1 E 2 E j ) ) = L ( [ G \ ( E 1 E 2 E j ) ] ( E 1 E 2 E j ) ( F 1 F ) ) = L ( G \ ( E 1 E 2 E j ) ) L ( E + 1 E j ) = L ( G \ ( E 1 E 2 E j ) )
since L ( E + 1 E j ) = K ¯ . We now have that k + j = γ ( G ) = γ ( L ( G ) ) = γ ( L ( G \ ( E 1 E 2 E j ) ) ) and k = γ ( G \ ( E 1 E 2 E j ) ) = γ ( L ( G \ ( E 1 E 2 E j ) ) ) , a contradiction since L ( G ) = L ( G \ ( E 1 E 2 E j ) ) . Thus, ε ( F U ( L ) ) < j . □
Lemma 2.
Let 1 j 5 and let n 4 j + φ ( k ) . If L : G n G n is an idempotent linear operator that preserves graphs of genus k and graphs of genus k + j then L is the identity mapping.
Proof. 
Consider F U ( L ) . By Lemma 1 ε ( F U ( L ) ) < j . Note, if F U ( L ) = K ¯ then L is the identity, so we assume that 1 ε ( F U ( L ) ) j 1 4 . Thus, the vertices incident with a tree dominated by F U ( L ) induces a subgraph of a K 5 , by permuting vertices, we may suppose that the K 5 = K 5 ( 1 ) is induced by vertices { v 1 , v 2 , v 3 , v 4 , v 5 } . Further, if F is any edge, L ( F ) F K 5 ( 1 ) . Let K 5 ( i ) , i = 2 , j be appended so that for H a graph of genus k on n 4 j vertices, G = K 5 ( 1 ) K 5 ( 2 ) K 5 ( j ) H dominates edges whose images dominate F W ( L ) .
Let F 2 , , F j be edges dominated by K 5 ( 2 ) , K 5 ( j ) respectively such that L ( F 2 . , . , F j ) F W ( L ) .
Then γ ( G ) = k + j and γ ( G \ ( F U ( L ) F 2 F j ) ) = k , so that γ ( L ( G ) ) = k + j and γ ( L ( G \ ( F U ( L ) F 2 F j ) ) ) = k . But,
L ( G ) = L ( [ G \ ( F U ( L ) F 2 F j ) ] [ F U ( L ) F 2 F j ] ) = L ( [ G \ ( F U ( L ) F 2 F j ) ] ) L ( [ F U ( L ) F 2 F j ] ) = L ( [ G \ ( F U ( L ) F 2 F j ) ] ) L ( F 2 F j ) .
But L ( F 2 F j ) adds at most j 1 to the genus of L ( G \ ( F U ( L ) F 2 F j ) ) . That is γ ( L ( G \ ( F U ( L ) F 2 F j ) ) ) k + j 1 .
That is L ( G ) = L ( G \ ( F U ( L ) F 2 F j ) ) , so k + j = γ ( L ( G ) ) = γ ( L ( G \ ( F U ( L ) F 2 F j ) ) ) k + j 1 , a contradiction.
We have shown that ε ( F U ( L ) ) = 0 and hence L is the identity. □
The following lemma was obtained in [6], but we include the proof for completeness.
Lemma 3
([6] Lemma 2.5). Let K be a finite set and ϕ : K K be arbitrary mapping. Then there is some natural number r such that ϕ r (the r-th power of ϕ) is idempotent.
Proof. 
Since K is finite, and ϕ can be considered a subset of K × K , the set { ϕ , ϕ 2 , ϕ 3 , , ϕ , } is a finite set. Thus there exist two nonnegative integers a , b with 1 a < b such that ϕ a = ϕ b . Let d = b a . Since ϕ a = ϕ b = ϕ ( a + d ) , if k is a nonnegative integer, then ϕ ( a + k d ) = ϕ ( a + d ) + ( k 1 ) d = ϕ ( a + ( k 1 ) d ) , etc. So that for any nonnegative integer k, ϕ ( a + k d ) = ϕ a .
Suppose that c is a nonnegative integer with c a . Then c = a + z for some nonnegative integer z. Thus, ϕ c + k d = ϕ ( a + z + k d ) = ϕ ( a + k d ) + z = ϕ ( a + z ) = ϕ c . That is, for any nonnegative integers c , k with c a , ϕ c + k d = ϕ c .
Now, let d = b a , then d 1 since b > a . Thus, a d a . Hence it follows that ϕ ( a d + k d ) = ϕ a d . For k = a we have ( ϕ a d ) 2 = ϕ 2 a d = ϕ ( a d + a d ) = ϕ a d . That is ϕ a d is idempotent. □
Theorem 2.
Let 1 j 5 and j h be positive integers and let n 4 j + 4 + φ ( h ) . If T : G n G n is a linear operator that preserves graphs of genus h and graphs of genus h + j then T is a vertex permutation.
Proof. 
Let L be a power of T that is idempotent as guaranteed by Lemma 3. By Lemma 2, L is the identity. It follows that T must be bijective since L is a power of T. Since 4 j + 4 + φ ( h ) 8 + φ ( h 1 ) , by Theorem 1 the theorem follows. □

4. Conclusions

In this article, we continue our investigation on the linear operators that preserve the genera of a graph. Now we showed that those linear operators are the form of vertex permutations. And we added some equivalent conditions of the linear operators on the set of graphs that preserve the genera of a graph, say, the linear operator that preserves two genera h and h + j of a graph. For further investigation, we give a conjecture:
Conjecture. If T : G n G n is a linear operator that preserves any two genera h and k of a graph, then T is a vertex permutation.

Author Contributions

Create and conceptualize ideas, L.B.B.; writing original draft preparation, L.B.B., K.-T.K. and S.-Z.S.; writing review and editing, L.B.B., K.-T.K. and S.-Z.S.; funding acquisition, S.-Z.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2016R1D1A1B02006812).

Acknowledgments

We would like to thank the anonymous reviewers for their very careful reading and valuable comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pullman, N.J. Linear operators that preserve clique covering numbers. ARS Comb. 1985, 19A, 27–36. [Google Scholar]
  2. Hershkowitz, D. Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices. Discrete Math. 1987, 64, 157–190. [Google Scholar] [CrossRef] [Green Version]
  3. Beasley, L.B.; Pullman, N.J. Linear operators preserving properties of graphs. Congr. Numer. 1990, 70, 105–112. [Google Scholar]
  4. Bondy, J.A.; Murty, U.S.R. Graph Theory; Graduate Texts in Mathematics 244; Springer: New York, NY, USA, 2008. [Google Scholar]
  5. Beasley, L.B.; Song, S.-Z. Linear operators that preserve the genus of a graph. Mathematics 2019, 7, 312. [Google Scholar] [CrossRef] [Green Version]
  6. Beasley, L.B.; Song, S.-Z. Genus of a graph and its strong preservers. Linear Multilinear Algebra 2020. [Google Scholar] [CrossRef]
Figure 1. The append of two graphs.
Figure 1. The append of two graphs.
Mathematics 08 00676 g001
Figure 2. K 4 E K 4 .
Figure 2. K 4 E K 4 .
Mathematics 08 00676 g002
Figure 3. The tree H.
Figure 3. The tree H.
Mathematics 08 00676 g003
Figure 4. The graph K 5 H .
Figure 4. The graph K 5 H .
Mathematics 08 00676 g004

Share and Cite

MDPI and ACS Style

Beasley, L.B.; Kang, K.-T.; Song, S.-Z. Linear Operators That Preserve Two Genera of a Graph. Mathematics 2020, 8, 676. https://doi.org/10.3390/math8050676

AMA Style

Beasley LB, Kang K-T, Song S-Z. Linear Operators That Preserve Two Genera of a Graph. Mathematics. 2020; 8(5):676. https://doi.org/10.3390/math8050676

Chicago/Turabian Style

Beasley, LeRoy B., Kyung-Tae Kang, and Seok-Zun Song. 2020. "Linear Operators That Preserve Two Genera of a Graph" Mathematics 8, no. 5: 676. https://doi.org/10.3390/math8050676

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop