454
Views
0
CrossRef citations to date
0
Altmetric
Articles

Face antimagic labelings of toroidal and Klein bottle grid graphs

, , &

Abstract

In this paper we deal with the problem of labeling the vertices, edges and faces of a toroidal Tnm and Klein bottle Knm grid graphs with mn 4-sided faces by the consecutive integers from 1 up to |V(Tnm)| + |E(Tnm)| + |F(Tnm)| and |V(Knm)| + |E(Knm)| + |F(Knm)| in such a way that the label of a 4-sided face and the labels of the vertices and edges surrounding that face all together add up to a weight of that face. These face-weights then form an arithmetic progression with common difference d. The paper examines the existence of such labelings for several differences d.

1 Introduction and definitions

Let GG be a family of 4-regular graphs embedded on the surface of a torus or Klein bottle such that each of its face is 4-sided. Let V(G) , E(G) and F(G) be the vertex set, the edge set and the face set of a graph GG, where v, e and f denote the cardinality of vertex, edge and face set respectively.

A labeling of type (1,1,1) is a bijection f:VEF{1,2,,v+e+f}. The weight of a 4-sided face under a labeling of type (1,1,1) is the sum of labels carried by that face and the edges and vertices surrounding it.

A labeling of type (1,1,1) of graph GG is called d-antimagic if the set of weights of all 4-sided faces is W={a,a+d,a+2d,,a+(f1)d} for some integers a>0 and d0, where f is the number of the 4-sided faces.

The concept of the d-antimagic labeling of plane graphs was defined in [Citation1]. The d-antimagic labeling of type (1,1,1) for the generalized Petersen graph P(n,2), hexagonal planar maps and grids can be found in [Citation2,3] and [Citation4], respectively. Lin et al. in [Citation5] showed that prism Dn, n3, admits d-antimagic labeling of type (1,1,1) for d{2,4,5,6}. The d-antimagic labeling of type (1,1,1) for Dn and for several d7 are described in [Citation6].

In particular for d=0, Lih in [Citation7] calls such labeling magic and describes magic (0-antimagic) labeling of type (1,1,0) for wheels, friendship graphs and prisms. Kathiresan and Gokulakrishnan [Citation8] provided the 0-antimagic labeling of type (1,1,1) for the families of planar graphs with 3-sided faces, 5-sided faces, 6-sided faces and one external infinite face.

A d-antimagic labeling of type (1,1,1) is called super if the smallest possible labels appear on the vertices. The super d-antimagic labelings of type (1,1,1) for antiprisms and for d{0,1,2,3,4,5,6} are described in [Citation9] and for disjoint union of prisms and for d{0,1,2,3,4,5} are given in [Citation10]. The existence of a super d-antimagic labeling of type (1,1,1) for the plane graphs containing a special Hamilton path is examined in [Citation11] and a super d-antimagic labeling of type (1,1,1) for disconnected plane graphs is given in [Citation12]. For more details (see [Citation13]). Plane graphs can also be embedded on other surfaces like torus, sphere, Klein bottle and projective plane (see [Citation14]).

Motivated by the paper [Citation15] we deal with the super d-antimagic labelings of type (1,1,1) for the toroidal grid and we describe those labelings for several values of d.

Let L be a regular square lattice and Pnm be an m×n quadrilateral section (with n squares on the top and bottom sides and m squares on the lateral sides,) cut from the regular square lattice L. First identify 2 lateral sides of Pnm to form a cylinder, and finally identify the top and bottom sides of cylinder at their corresponding points; see .

Fig. 1 Toroidal grid graph.

Fig. 1 Toroidal grid graph.

Thus we get a toroidal grid graph Tnm with mn 4-sided faces, mn vertices, and 2mn edges. More about toroidal grid can be found in ([Citation16]).

In the case of Klein bottle grid first we identify lateral side of Pnm to form a cylinder and then identify the top and bottom sides of the cylinder in opposite direction. By this identification of Pnm, we get Klein bottle grid graph Knm with mn 4-sided faces, mn vertices, and 2mn edges. see .

Fig. 2 Klein bottle grid graph.

Fig. 2 Klein bottle grid graph.

2 Necessary conditions

In this section, we shall find bound for a feasible value of d for the super d-antimagic labeling of type (1,1,1) for the toroidal grid Tnm and Klein bottle grid Knm.

Let g be such a labeling. We consider weights of 4-sided faces of the toroidal grid separately for a vertex labeling, an edge labeling and a face labeling. For d-antimagic vertex labeling φ1:V(Tnm){1,2,,|V(Tnm)|} the minimum possible weight of a 4-sided face is at least 1+2+3+4 and the maximum weight of a 4-sided face is no more than i=14(|V(Tnm)|i+1)=4nm6.Thus a4+(f41)d4nm6and d412nm1.

Lemma 1

For every toroidal grid Tnm, n3, m3, there is no d-antimagic vertex labeling with d4.

Assume that Tnm has a d-antimagic edge labeling φ2 with |E(Tnm)| values from the set {|V(Tnm)|+1,|V(Tnm)|+2,,|V(Tnm)|+|E(Tnm)|+|F(Tnm)|}. Then the minimum possible weight of 4-sided face is at least i=14(|V(Tnm)|+i)=4mn+10 and the maximum weight of 4-sided face is no more than i=14|V(Tnm)|+|E(Tnm)|+|F(Tnm)|+1i=16nm6.Hence a4+(f41)d16nm6.It is easy to see that d124nm1.

Lemma 2

For every toroidal grid Tnm, n3, m3, there is no d-antimagic edge labeling with d12.

According to Lemma 1, Lemma 2 and the fact that under a d-antimagic face labeling φ3 with f4 values from the set {|V(Tnm)|+1,|V(Tnm)|+2,,|V(Tnm)|+|E(Tnm)|+|F(Tnm)|} the parameter d is no more than 3, we obtain the following theorem.

Theorem 1

Let Tnm, n3, m3, be a toroidal grid graph which admits d1-antimagic vertex labeling φ1, d2-antimagic edge labeling φ2 and d3-antimagic face labeling φ3. If the labelings φ1, φ2 and φ3 combine to a super d-antimagic labeling of type (1,1,1) then the parameter d17.

Remark 1

Similarly, we can estimate the bound d17 for the Klein bottle grid graph.

3 d-antimagic labeling of toroidal grid graph

Let V(Tnm)={(xs,yt):0sn1,0tm1} be the vertex set of the graph Tnm, E(Tnm)={(xs,yt)(xs+1,yt):0sn1,0tm1}{(xs,yt)(xs,yt+1):0sn1,0tm1} be the edge set and F(Tnm)={zs,t:0sn1,0tm1} be the face set with indices s and t taken modulo n and m respectively. The face zs,t is bounded by edges (xs,yt)(xs+1,yt), (xs+1,yt)(xs+1,yt+1), (xs,yt+1)(xs+1,yt+1), (xs,yt)(xs,yt+1). (See ).

Fig. 3 Toroidal grid identification.

Fig. 3 Toroidal grid identification.

In this section we will use a similar idea which was used for an investigation of d-antimagic labeling of generalized prism in [Citation17].

Lemma 3

Let Tnm n,m3 be toroidal grid and let α1((xs,yt))={tn+1+s,0sn1,0tm1}and α1((xs,yt)(xs+1,yt))={mn+(mt)ns,0sn1,0tm1}. If n3 and m3, then the partial weights of zs,t under the labeling α1 for every t,0tm2, constitute an arithmetic sequence of difference 2 and for t=m1 the partial weights zs,m1 constitute the sequence n(5m1)+4,n(5m1)+6,,n(5m+1)+2.

Proof

Under the labeling α1, for every t, 0tm1, the partial weights of 4-sided faces zs,t are as follows: wtα1(zs,t)=α1((xs,yt))+α1((xs+1,yt))+α1((xs,yt+1))+α1((xs+1,yt+1))+α1((xs,yt)(xs+1,yt))+α1((xs,yt+1)(xs+1,yt+1)) (1) wtα1(zs,t)=n(4m+1+2t)+6+2s,for0sn2,0tm2n(4m+1+2t)+4,fors=n1,0tm2n(5m1)+6+2s,for0sn2,t=m1n(5m1)+4,fors=n1,t=m1.(1) This shows that for every t,s, 0tm1, 0sn1, the partial weights of zs,t form the arithmetic sequence with difference 2 from n(4m+1)+4 up to n(6m1)+2 and for every s, 0sn1, the partial weights of zs,m1 form the arithmetic sequence with difference 2 from n(5m1)+4 up to n(5m+1)+2.

Lemma 4

Let Tnm n,m3 be toroidal grid and let for every t, 0tm1 β1((xs,yt)(xs,yt+1))=n(3mt)1s,for0sn2n(3mt),fors=n1 β1(zs,t)=n(3m+t)+3+s,for0sn3n(3m+t)+1,fors=n2n(3m+t)+2,fors=n1.If n3 and m3, then under the labeling β1 the partial weights of zs,t, for every t, 0tm1, form an arithmetic sequence of difference 1.

Proof

The partial weights of the 4-sided faces zs,t under the labeling β1, for every t, 0tm1, admit values wtβ1(zs,t)=β1((xs,yt)(xs,yt+1))+β1(zs,t)+β1((xs+1,yt)(xs+1,yt+1)) (2) wtβ1(zs,t)=n(9mt)s,for0sn2,0tm1n(9mt)+1,fors=n1,0tm1.(2)

This shows that the partial weights of zs,t form the arithmetic sequence with difference 1 from 8mn+2 up to 9mn+1.

Lemma 5

Let for every s, 0sn1 β2((xs,yt)(xs,yt+1))=n(2m+t+1)+1+s,for0tm22mn+1+s,fort=m1 β2(zs,t)=n(4mt)s,for0tm1.If n3 and m3, then the partial weights of zs,t under the labeling β2, for every t, 0tm1 constitute an arithmetic sequence of difference 1.

Proof

The partial weights of the 4-sided faces zs,t under the labeling β2, for every t, 0tm1, attain values

wtβ2(zs,t)=β2((xs,yt)(xs,yt+1))+β2(zs,t)+β2((xs+1,yt)(xs+1,yt+1)) (3) wtβ2(zs,t)=n(8m+2+t)+3+s,for0sn2,0tm2n(8m+2+t)+2,fors=n1,0tm2n(7m+1)+3+s,for0sn2,t=m1n(7m+1)+2,fors=n1,t=m1.(3) Thus, under the labeling β2 the partial weights of 4-sided faces zs,k, 0sn1, 0tm2, constitute the arithmetic sequence of difference 1 from n(8m+2)+2 up to n(9m+1)+1 and for 0sn1 the partial weights zs,m1 attain consecutive values n(7m+1)+2,n(7m+1)+3,,n(7m+2)+1.

Theorem 2

For n3 and m3, the toroidal grid graph Tnm has a super 1-antimagic labeling and a super 3-antimagic labeling of type (1,1,1).

Proof

Case d=1.

It follows from Lemmas 3 and 4 that under the labeling α1 and β1 the weights of all 4-sided faces are wt(zs,t)=wtα1(zs,t)+wtβ1(zs,t)=n(13m+1+t)+6+s,for0sn2,0tm2n(13m+1+t)+5,fors=n1,0tm213mn+6+s,for0sn2,t=m113mn+5,fors=n1,t=m1.This shows that the weights of the 4-sided faces form an arithmetic sequence with difference 1 starts from 13mn+5 up to 14mn+4.

Case d=3.

Taking into account Lemmas 3 and 5 we can see that under the labeling α1 and β2 the weights of 4-sided faces are wt(zs,t)=wtα1(zs,t)+wtβ2(zs,t)=n(12m+3+3t)+9+3s,for0sn2,0tm2n(12m+3+3t)+6,fors=n1,0tm212mn+9+3s,for0sn2,t=m112mn+6,fors=n1,t=m1.Thus the weights of all 4-sided faces constitute an arithmetic sequence of the difference 3, namely 12mn+6 up to 15mn+3.

4 d-antimagic labeling of Klein bottle grid graph

Let V(Knm)={(xs,yt):0sn1,0tm1} be the vertex set, E(Knm)={(xs,yt)(xs+1,yt):0sn1,0tm1}{(xs,yt)(xs,yt+1):0sn1,0tm2}{(xs,ym1)(xns,y0):0sn1}{(x0,ym1)(x0,y0)} be the edge set and F(Knm)={zs,t:0sn1,0tm1} be the face set. The face zs,t is bounded by edges (xs,yt)(xs+1,yt), (xs+1,yt)(xs+1,yt+1), (xs,yt+1)(xs+1,yt+1), (xs,yt)(xs,yt+1), for 0sn1,0tm2 and zs,m1 is bounded by edges (xs,ym1)(xs+1,ym1), (xs,ym1)(xns,y0), (xns,y0)(xn(s+1),y0), (xs+1,ym1)(xn(s+1),y0) for 1sn1 and z0,m1 is bounded by edges (x0,ym1)(x1ym1), (x1,ym1)(xn1y0), (x0,y0)(xn1y0), (x0,ym1)(x0y0), (see ):

Fig. 4 Klein bottle grid identification.

Fig. 4 Klein bottle grid identification.

Lemma 6

Let λ1((xs,yt))={tn+1+s,0sn1,0tm1}and λ1((xs,yt)(xs+1,yt))={n(2mt)s,0sn1,0tm1}. If n3 and m3, then under the labeling λ1 the partial weights of zs,t for every t,s, 0tm2, 0sn1, constitute an arithmetic sequence of difference 2 and the partial weights of zs,m1 for 1sn2 are 5mn+5 and for z0,m1 and zn1,m1 are n(5m1)+5.

Proof

Under the labeling λ1, for every t, 0tm2, the partial weights of 4-sided faces zs,t are as follows: wtλ1(zs,t)=λ1((xs,yt))+λ1((xs+1,yt))+λ1((xs,yt+1))+λ1((xs+1,yt+1))+λ1((xs,yt)(xs+1,yt))+λ1((xs,yt+1)(xs+1,yt+1)) (4) wtλ1(zs,t)=n(4m+2t+1)+6+2s,for0sn2,0tm2n(4m+2t+1)+4,fors=n1,0tm2.(4) This shows that for every t and s, 0tm2, 0sn1, the partial weights of 4-sided faces zs,t form the arithmetic sequence with difference 2 from n(4m+1)+4 up to n(6m1)+2. For 1sn2 the partial weights of zs,m1 are 5mn+5 and wtλ1(z0,m1)=wtλ1(zn1,m1)=n(5m1)+5.

Lemma 7

Let μ1((xs,yt)(xs,yt+1))=n(3mt)s1,for0sn2,0tm2n(3mt),fors=n1,0tm2

μ1((xs,ym1)(xns,y0))=n(2m+1)s1,for0sn2n(2m+1),fors=n1

μ1(zs,t)=n(3m+t)+3+s,for0sn3,0tm2n(3m+t1)+3+s,forn2sn1,0tm2 μ1(zs,m1)=n(4m1)+3+s,for0sn3n(4m2)+3+s,forn2sn1.If n3 and m3, then the partial weights of zs,t under the labeling μ1 for every t and s, 0tm1, 0sn1, constitute an arithmetic sequence of difference 1.

Proof

Under the given labeling μ1, for every t, 0tm2, the partial weights of the 4-sided faces, admit the following values wtμ1(zs,t)=μ1((xs,yt)(xs,yt+1))+μ1(zs,t)+μ1((xs+1,yt)(xs+1,yt+1)) (5) wtμ1(zs,t)=n(9mt)+1,fors=n1,0tm2n(9mt)s,for0sn2,0tm2(5) (6) wtμ1(zs,m1)=n(8m+1)+1,fors=n1n(8m+1)s,for0sn2.(6) This shows that the partial weights of 4-sided faces form the arithmetic progression with difference 1 with values from 8mn+2 up to 9mn+1.

Lemma 8

Let μ2((xs,yt)(xs,yt+1))= n(2m+t+1)+s+1,for0sn1,0tm2 μ2(zs,t)=n(4mt)s,for0sn1,0tm2.

If n3 and m3, then the partial weights of zs,t under the labeling μ2, for every t, 0tm2, constitute an arithmetic sequence of difference 1.

Proof

Under the labeling μ2, for every t, 0tm2, the partial weights of the 4-sided face attain values

wtμ2(zs,t)=μ2((xs,yt)(xs,yt+1))+μ2(zs,t)+μ2((xs+1,yt)(xs+1,yt+1)). (7) wtμ2(zs,t)=n(8m+2+t)+s+3,for0sn2,0tm2n(8m+2+t)+2,fors=n1,0tm2.(7) Thus partial weights of 4-sided faces under the labeling μ2, constitute the arithmetic sequence of difference 1.

Lemma 9

Let μ2((xs,ym1)(xns,y0))= n(2m+1)s+1,for1sn1,t=m12mn+1,fors=0,t=m1

μ2(zs,m1)=n(3m+1)s,for0sn1.If n3 and m3, then the partial weights of zs,m1 under the labeling μ2, constitute an arithmetic sequence of difference 1.

Proof

Under the labeling μ2 defined for 0tm2 in Lemma 8 and for t=m1 defined above, the partial weights of the 4-sided face attain values wtμ2(zs,m1)=μ2((xs,ym1)(xns,y0))+μ2(zs,m1)+μ2((xs+1,ym1)(xn(s+1),y0)). (8) wtμ2(zs,m1)=n(7m3s+3)+1,for1sn1n(7m+2)+1,fors=0.(8) Thus weights of 4-sided faces under the labeling μ2, constitute the arithmetic sequence of difference 1.

Theorem 3

For n3 and m3, the Klein bottle grid graph Knm admits a super 1-antimagic labeling and a super 3-antimagic labeling of type (1,1,1).

Proof

Case d=1. It follows from Lemmas 6 and 7 that under the labeling λ1 and μ1 the weights of all 4-sided faces are wt(zs,t)=wtλ1(zs,t)+wtμ1(zs,t)=n(13m+t+1)+s+6,for0sn2,0tm2n(13m+t+1)+5,fors=n1,0tm2n(13m+1)+5s,for1sn1,t=m113mn+5,fors=0,t=m1.This shows that the weights of the 4-sided faces form an arithmetic sequence with difference 1 with values from 13mn+5 up to 14mn+4.

Case d=3.

Taking into account Lemmas 6, 8 and 9 along with the following swapping

λ1((xn3,ym1))λ1((xn1,ym1))

μ2((zn1,m1))μ2((zn3,m1))

μ2((zn2,m1))μ2((z4,m1))

μ2((zn2,m2))μ2((z4,m2))

μ2((zn1,m2))μ2((zn3,m2))

we can see that under the labeling λ1 and μ2 the weights of 4-sided faces are wt(zs,t)=wtλ1(zs,t)+wtμ2(zs,t)=n(12m+3t+3s+3)+9,for0sn2,0tm2n(12m+3t+3)+6,fors=n1,0tm2n(12m+3)3s+6,for1sn2,t=m1n(12m+1)+1,fors=0,t=m1n(12m+1)2,fors=n1,t=m1.Finally the weights of the all 4-sided faces of given graph form an arithmetic progression with the common difference 3, starting from 12mn+6 up to 15mn+3.

5 Conclusion

In this paper we examine the existence of super d-antimagic labeling of type (1,1,1) for toroidal grid graph Tnm and Klein bottle grid graph Knm. We show that Tnm and Knm admit a super d-antimagic labeling of type (1,1,1) for d=1,3, for all n,m3. However we tried to describe a super d-antimagic labeling of type (1,1,1) of graphs Tnm and Knm for d=0,2,4 but without success.

Therefore we conclude the paper with the following open problem.

Open problem 1

For the toroidal grid Tnm and Klein bottle grid Knm, n,m3, determine whether there is a super d-antimagic labeling of type (1,1,1) for d=0,2,4.

Acknowledgment

The research for this article was supported by APVV-15-0116 and by VEGA 1/0233/18.

References

  • BačaM., MillerM., On d-antimagic labelings of type (1,1,1) for prisms, J. Combin. Math. Combin. Comput., 44 2003 199–207
  • BačaM., Jendrol’S., MillerM., RyanJ., Antimagic labelings of generalized Petersen graphs that are plane, Ars Combin., 73 2004 115–128
  • BačaM., BaskoroE.T., Jendrol’S., MillerM., Antimagic labelings of hexagonal planar maps, Util. Math., 66 2004 231–238
  • BačaM., LinY., MillerM., Antimagic labelings of grids, Util. Math., 72 2007 65–75
  • LinY., Slamin M. Bača, MillerM., On d-antimagic labelings of prisms, Ars Combin., 72 2004 65–76
  • SugengK.A., MillerM., LinY., BačaM., Face antimagic labelings of prisms, Util. Math., 71 2006 269–286
  • LihK.W., On magic and consecutive labelings of plane graphs, Util. Math., 24 1983 165–197
  • KathiresanK., GokulakrishnanS., On magic labelings of type (1,1,1) for the special classes of plane graphs, Util. Math., 63 2003 25–32
  • BačaM., BashirF., SemaničováA., Face antimagic labelings of antiprisms, Util. Math., 84 2011 209–224
  • AliG., BačaM., BashirF., Semaničová-FeňovčíkováA., On face antimagic labelings of disjoint union of prisms, Util. Math., 85 2011 97–112
  • BačaM., BrankovicL., Semaničová-FeňovčíkováA., Labelings of plane graphs containing Hamilton path, Acta Math. Sin. (Engl. Ser.), 2742011 701–714
  • BačaM., MillerM., PhanalasyO., Semaničová-FeňovčíkováA., Super d-antimagic labelings of disconnected plane graphs, Acta Math. Sin. (Engl. Ser.), 26122010 2283–2294
  • GallianJ., A dynamic survey of graph labeling, Electron. J. Combin., 17 2016 #DS6
  • DezaM., FowlerP.W., RassatA., RogersK.M., Fullerenes as tilings of surfaces, J. Chem. Inf. Comput. Sci., 40 2000 550–558
  • BačaM., NumanM., ShabbirA., Labelings of type (1,1,1) for toroidal fullerenes, Turk. J. Math., 37 2013 899–907
  • Tao-Ming Wang, Toroidal grids are anti-magic, in: COCOON 2005, pp. 671–679.
  • ButtS.I., NumanM., ShahI.A., AliS., Face labelings of type (1, 1, 1) for generalized prism, Ars Combin., 137 2018 41–52