• No results found

Vertex Equitable Labeling of Double Alternate Snake Graphs

N/A
N/A
Protected

Academic year: 2020

Share "Vertex Equitable Labeling of Double Alternate Snake Graphs"

Copied!
8
0
0

Loading.... (view fulltext now)

Full text

(1)

journal homepage: http://jac.ut.ac.ir

Vertex Equitable Labeling of Double Alternate Snake

Graphs

P. Jeyanthi

∗1

, A. Maheswari

†2

and M.Vijayalakshmi

‡3

1Research Center, Department of Mathematics, Govindammal Aditanar College for women,

Tiruchendur - 628 215, Tamilnadu,India

2Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar,

India.

3Department of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram,

Thoothukudi District, Tamilnadu, India.

ABSTRACT ARTICLE INFO

Let G be a graph with p vertices and q edges and

A=0,1,2, . . . ,2q . A vertex labeling f :V(G)→A

induces an edge labeling f∗ defined byf(uv) =f(u) +

f(v) for all edges uv. For a ∈ A, let vf(a) be the

num-ber of vertices v with f(v) = a. A graph G is said to

be vertex equitable if there exists a vertex labeling f

such that for all a and b in A,|vf(a)−vf(b)| ≤ 1 and

the induced edge labels are 1,2,3, . . . , q. In this paper, we prove thatDA(Tn)⊙K1, DA(Tn)⊙2K1(DA(Tn)

de-note double alternate triangular snake) and DA(Qn)⊙

K1, DA(Qn) ⊙ 2K1(DA(Qn) denote double alternate

quadrilateral snake) are vertex equitable graphs.

Article history:

Received 12, January 2015 Received in revised form 14, September 2015

Accepted 25, September 2015 Available online 7, January 2016

AMS subject Classification: 05C78

Corresponding author. E-mail: jeyajeyanthi@redif f mail.comEmail:bala nithin@yahoo.co.in

Email:V iji mac@redif f mail.com

(2)

1

Introduction

All graphs considered here are simple, finite, connected and undirected. We follow the basic notations and terminology of graph theory as in [1]. There are several types of labeling and a detailed survey of graph labeling is found in [2]. The concept of vertex

equitable labeling was due to Lourdusamy and Seenivasan [3]. Let G be a graph with p

vertices andq edges and A=0,1,2, . . . ,q

2 .A graph Gis said to be vertex equitable

if there exists a vertex labeling f : V(G) → A that indcues an edge labeling f∗ defined

by f∗(uv) =f(u) +f(v) for all edges uv such that for alla and binA,|v

f(a)−vf(b)| ≤1

and the induced edge labels are 1,2,3, . . . , q,wherevf(a) be the number of verticesv with f(v) =a for a∈A.

The vertex labeling f is known as vertex equitable labeling. In [3] the authors proved

that the graphs like path, bistarB(n, n), combs, cycle Cn ifn ≡0 or 3(mod 4), K2,n, C

(t) 3

for t ≥2, quadrilateral snake, K2+mK1, K1,n∪K1,n+k if and only if 1≤k ≤3, ladder,

arbitrary super division of any path and cycle Cn with n ≡ 0 or 3(mod 4) are vertex

equitable. Also they proved that the graphsK1,nifn ≥4,any Eulerian graph withnedges

where n ≡1 or 2(mod 4), the wheel Wn,the complete graph Kn if n > 3 and triangular

cactus withq≡0 or 6 or 9(mod12) are not vertex equitable. In addition, they proved that

ifG is a graph withpvertices and q edges,q is even andp <q

2

+ 2 thenGis not vertex

equitable graph. Motivated by these results, we [4, 5, 6, 7, 8] proved thatTp-tree, T⊙Kn

whereT is a Tp-tree with even number of vertices, TboPn, Tbo2Pn, TboCn(n≡0,3(mod4)), TeoCn(n ≡ 0,3(mod 4)), bistar B(n, n+ 1), square graph of Bn,n and splitting graph of Bn,n,the caterpillar S(x1, x2, . . . , xn) and Cn⊙K1, Pn2,tadpoles,Cm⊕Cn,armed crowns,

[Pm;Cn2],hPmboK1,ni, kC4-snakes for allk ≥1,generalizedkCn-snake ifn≡0(mod4), n≥

4 and the graphs obtained by duplicating an arbitrary vertex and an arbitrary edge of a cycle Cn,total graph of Pn,splitting graph ofPn and fusion of two edges of a cycleCn are

vertex equitable graphs. In this paper we extend our study on vertex equitable labeling and prove that the graphs DA(Tn)⊙K1, DA(Tn)⊙2K1, DA(Qn)⊙K1, DA(Qn)⊙2K1

are vertex equitable.

Definition 1.1. The corona G1 ⊙ G2 of the graphs G1 and G2 is defined as a graph

obtained by taking one copy of G1 (with p vertices) and p copies of G2 and then joining

the ith vertex of G

1 to every vertex of the ith copy of G2.

Definition 1.2. A double alternate triangular snake DA(Tn) consists of two alternate

triangular snakes that have a common path. That is, a double alternate triangular snake is obtained from a path u1, u2, . . . , un by joining ui andui+1(alternately) to two new vertices

(3)

Definition 1.3. A double alternate quadrilateral snakeDA(Qn)consists of two alternate

quadrilateral snakes that have a common path. That is, a double alternate quadrilateral snake is obtained from a path u1, u2, . . . , un by joining ui and ui+1 (alternately) to two

new vertices vi, xi and wi, yi respectively and then joiningvi, wi and xi, yi.

2

Main Results

Theorem 2.1. The graph DA(Tn)⊙K1 is a vertex equitable graph.

Proof. LetG=DA(Tn)⊙K1. Let u1, u2, . . . , un be the vertices of path Pn.

Case (i) The triangle starts from u1.

We constructDA(Tn) by joining every u2i−1, u2ito the new vertices vi, wi for 1≤i≤ ⌊n2⌋.

Let V(G) = V(DA(Tn)) ∪ {u′i : 1 ≤ i ≤ n} ∪

v′

i, w′i : 1≤i≤ ⌊n2⌋ and E(G) =

E(DA(Tn))∪ {uiu′i : 1 ≤ i ≤ n} ∪

vivi′, wiw′i: 1≤i≤ ⌊ n

2⌋ . We consider the

follow-ing two subcases.

Subcase (i) n is even.

Here |V(G)| = 4n and |E(G)| = 5n−1. Let A = 0,1,2, . . . ,5n−1

2 . Define a vertex

labeling f : V(G) → A as follows. For 1 ≤ i ≤ n

2, f(u2i−1) = 5(i − 1), f(u2i) =

5i, f(u′

2i−1) = 5i−4, f(u′2i) = 5i−1, f(vi) = f(v′i) = 5i−3 and f(wi) =f(wi′) = 5i−2.

It can be verified that the induced edge labels of DA(Tn)⊙K1 are 1,2, . . . ,5n−1 and

|vf(i)−vf(j)| ≤1 for alli, j ∈A. Hencef is a vertex equitable labeling of DA(Tn)⊙K1.

Subcase (ii) n is odd.

Here|V(G)|= 4n−2 and|E(G)|= 5n−4.LetA=0,1,2, . . . ,5n−4

2 .Define a vertex

labeling f : V(G) → A as follows. We label the vertices u2i−1, u′2i−1 1≤i≤

n

2

and

u2i, u′2i, vi, v′i, wi, wi′ 1≤i≤ n−21

as in Subcase (i). It can be verified that the induced edge labels of DA(Tn)⊙K1 are 1,2, . . . , 5n−4 and |vf(i)−vf(j)| ≤ 1 for all i, j ∈ A.

Hence f is a vertex equitable labeling of DA(Tn)⊙K1.

Case (ii) The triangle starts from u2.

We constructDA(Tn) by joining every u2i, u2i+1to the new vertices vi, wifor 1≤i≤ n−22.

Let V(G) = V(DA(Tn))∪ {u′i : 1 ≤ i ≤ n} ∪

v′

i, w′i : 1≤i≤

n2

2 and E(G) =

E(DA(Tn))∪ {uiu′i : 1≤i≤n} ∪

viv′i, wiw′i : 1≤i≤

n−2 2 .

Subcase (i) n is even.

Here|V(G)|= 4n−4 and|E(G)|= 5n−7.LetA=0,1,2, . . . ,5n−7

2 .Define a vertex

labeling f : V(G) → A as follows: For 1 ≤ i ≤ n

2, f(u2i−1) = f(u2i) = 5i−4, f(u′1) =

0, f(u′

2i) = 5i−3. For 1≤ i≤ n−22, f(u′2i+1) = 5i−1, f(vi) = 5i, f(vi′) = f(wi) = 5i−2

and f(w′

i) = 5i−3. It can be verified that the induced edge labels of DA(Tn)⊙K1 are

1,2, . . . , 5n −7 and |vf(i)−vf(j)| ≤ 1 for all i, j ∈ A. Hence f is a vertex equitable

labeling of DA(Tn)⊙K1.

(4)

The proof can be omitted since by symmetry, the graph obtained in this subcase is isomorphic to the graph obtained in Subcase (ii) under Case (i).

An example for the vertex equitable labeling of DA(T8)⊙K1 where the two triangles

start from u1 is shown in Figure 1.

Figure 1

Theorem 2.2. The graph DA(Tn)⊙2K1 is a vertex equitable graph.

Proof. LetG=DA(Tn)⊙2K1. Let u1, u2, . . . , un be the vertices of path Pn.

Case (i) The triangle starts from u1.

We constructDA(Tn) by joining every u2i−1, u2ito the new vertices vi, wi for 1≤i≤ ⌊n2⌋.

Let V(G) = V(DA(Tn))∪ {u′

i, u′′i : 1 ≤ i ≤ n} ∪ {vi′, vi′′, w′i, wi′′: , 1 ≤i≤

n

2 and

E(G) = E(DA(Tn))∪ {uiu′i, uiu′′i : 1 ≤ i ≤ n} ∪ {vivi′, viv′′i, wiwi′, wiwi′′: 1≤i≤

n

2 .

We consider the following two subcases. Subcase (i) n is even.

Here |V(G)| = 6n and |E(G)| = 7n−1. Let A = 0,1,2, . . . ,7n−1

2 . Define a

ver-tex labeling f : V(G) → A as follows. For 1 ≤ i ≤ n

2, f(u2i−1) = 7(i−1), f(u2i) =

7i, f(u′

2i−1) = 7i − 6, f(u2′i) = f(w′i) = 7i −2, f(u′′2i−1) = f(vi′) = 7i −5, f(u′′2i) =

7i−1, f(vi) =f(vi′′) = 7i−4, f(wi) =f(w′i) = 7i−3.It can be verified that the induced

edge labels of DA(Tn)⊙2K1 are 1,2, . . . ,7n−1 and |vf(i)−vf(j)| ≤ 1 for all i, j ∈A.

Hence f is a vertex equitable labeling of DA(Tn)⊙2K1.

Subcase (ii) n is odd.

Here|V(G)|= 6n−3 and|E(G)|= 7n−5.LetA=0,1,2, . . . ,7n−5

2 .Define a vertex

labeling f : V(G)→ A as follows. We label the vertices u2i−1, u′2i−1, u′′2i−1 1≤i≤

n

2

and u2i, u′2i, u2′′i, vi, vi′, vi′′, wi, wi′, w′′i 1≤ i≤ n−21

as in Subcase (i). It can be verified that the induced edge labels of DA(Tn)⊙2K1 are 1,2, . . . ,7n−5 and |vf(i)−vf(j)| ≤1 for

alli, j ∈A. Hence f is a vertex equitable labeling of DA(Tn)⊙2K1.

(5)

We construct DA(Tn) by joining every u2i, u2i+1 to the vertices vi, wi for 1≤ i≤ ⌈n−22⌉.

Let V(G) = V(DA(Tn))∪ {u′i, u′′i : 1 ≤ i ≤ n} ∪ {v′i, vi′′, wi′, wi′′ : 1 ≤ i ≤

n2

2

} and

E(G) =E(DA(Tn))∪ {uiu′i, uiu′′i : 1≤i≤n} ∪ {vivi′, vivi′′, wiwi′, wiwi′′: 1≤i≤

n2

2

}.

Subcase (i) n is even.

Here|V(G)|= 6n−6 and|E(G)|= 7n−9.LetA=0,1,2, . . . ,7n−9

2 .Define a vertex

labeling f :V(G) →A as follows: For 1≤ i ≤ n

2, f(u2i−1) = f(u2′′i−1) = 7i−6, f(u2i) =

7i−5, f(u′

2i−1) = 7(i−1), f(u′2i) = 7i−5, f(u′′2i) = 7i−4. For 1 ≤ i ≤ n−22, f(vi) =

7i−3, f(v′

i) = 7i−4, f(vi′′) = f(w′i) = 7i−2, f(wi) = 7i−1, f(w′′i) = 7i.It can be verified

that the induced edge labels of DA(Tn)⊙2K1 are 1,2, . . . ,7n−9 and|vf(i)−vf(j)| ≤1

for all i, j ∈A. Hence f is a vertex equitable labeling of DA(Tn)⊙2K1.

Subcase (ii) n is odd.

The proof can be omitted since by symmetry, the graph obtained in this subcase is isomorphic to the graph obtained in Subcase (ii) under Case (i).

An example for the vertex equitable labeling of DA(T5)⊙2K1 where the two triangles

start from u1 is shown in Figure 2.

Figure 2

Theorem 2.3. The graph DA(Qn)⊙K1 is a vertex equitable graph.

Proof. LetG=DA(Qn)⊙K1. Letu1, u2, . . . , un be the vertices of path Pn.

Case (i) The quadrilateral starts from u1.

We construct DA(Qn) by joining every u2i−1 to vi, xi and u2i is adjacent to wi, yi and vi

is adjacent to wi and xi is adjacent to yi for 1≤i≤ ⌊n2⌋. Let V(G) =V(DA(Qn))∪ {u′i : 1≤i≤n} ∪

v′

i, w′i, x′i, yi′ : 1 ≤i≤

n

2 and

E(G) = E(DA(Qn))∪

vivi′, wiwi′, xix′i, yiyi′ : 1≤i≤

n

2 ∪ {uiu′i : 1 ≤ i ≤ n}. We

consider the following two subcases. Subcase (i) n is even.

Here |V(G)| = 6n and |E(G)| = 7n−1. Let A = 0,1,2, . . . ,7n−1

2 . Define a vertex

(6)

For 1 ≤ i ≤ n

2, f(u2i−1) = 7(i−1), f(u2i) = 7i, f(u2′i−1) = 7i−5, f(u′2i) = f(w′i) = 7i−

1, f(vi) =f(x′i) = 7i−6, f(xi) = 7i−4, f(vi′) = f(yi) = 7i−2 and f(wi) =f(yi′) = 7i−3.

It can be verified that the induced edge labels of DA(Qn)⊙K1 are 1,2, . . . ,7n−1 and

|vf(i)−vf(j)| ≤1 for alli, j ∈A.Hence f is a vertex equitable labeling ofDA(Qn)⊙K1.

Subcase (ii) n is odd.

Here|V(G)|= 6n−4 and|E(G)|= 7n−6.LetA=0,1,2, . . . ,7n−6

2 .Define a vertex

labelingf :V(G)→Aas follows. We label the verticesu2i−1 1≤i≤n2, 1≤i≤n2

and u2i, u′

2i−1, u′2i, vi, vi′, wi, wi′, xi, x′i, yi, yi′ , 1≤i≤ n−21

as in Subcase(i) and define

f(u′

n) =

7n6

2

. It can be verified that the induced edge labels of DA(Qn)⊙K1 are

1,2, . . . ,7n−6 and |vf(i)−vf(j)| ≤ 1 for all i, j ∈ A. Hence f is a vertex equitable

labeling of DA(Qn)⊙K1.

Case (ii) The quadrilateral starts fromu2.

We construct DA(Qn) by joining everyu2i tovi, xi andu2i+1 is adjacent towi, yi andvi is

adjacent to wi andxi is adjacent to yi for 1≤i≤

n2

2

. LetV(G) = V(DA(Qn))∪ {u′i :

1≤i≤n} ∪v′

i, w′i, x′i, yi′ : 1≤i≤

n2

2 and

E(G) =E(DA(Qn))∪

viv′i, wiw′i, xix′i, yiyi′ : 1≤i≤

n−2

2 ∪ {uiu′i : 1≤i≤n}.

Subcase (i) n is even.

Here|V(G)|= 6n−8 and|E(G)|= 7n−11.LetA=0,1,2, . . . ,7n−11

2 .Define a vertex

labeling f : V(G) → A as follows: For 1 ≤ i ≤ n

2, f(u2i−1) = f(u2i) = 7i−6, f(u′1) =

0, f(u′

n) =

7n11

2

. For 1 ≤ i ≤ n−2

2 , f(u′2i) = f(vi′) = 7i −4, f(vi) = f(u′2i+1) =

7i−5, f(wi) = f(w′i) = 7i−3, f(xi) = 7i−1, f(x′i) = 7i−2 and f(yi) = f(y′i) = 7i. It

can be verified that the induced edge labels of DA(Qn)⊙K1 are 1,2, . . . , 7n−11 and

|vf(i)−vf(j)| ≤1 for alli, j ∈A.Hence f is a vertex equitable labeling ofDA(Qn)⊙K1.

Subcase (ii) n is odd.

The proof can be omitted since by symmetry, the graph obtained in this subcase is isomorphic to the graph obtained in Subcase (ii) under Case (i).

An example for the vertex equitable labeling ofDA(Q6)⊙K1 where the two quadrilateral

start from u2 is shown in Figure 3.

Figure 3

(7)

Proof. LetG=DA(Qn)⊙2K1. Letu1, u2, . . . , un be the vertices of pathPn.

Case (i) The quadrilateral starts from u1.

We construct DA(Qn) by joining every u2i−1 to vi, xi and u2i is adjacent to wi, yi and vi

is adjacent to wi and xi is adjacent to yi for 1 ≤ i ≤ ⌊n2⌋. Let V(G) = V(DA(Qn))∪

{u′

i, u′′i : 1≤i≤n}∪

v′

i, v′′i, wi′, w′′i, x′i, x′′i, y′i, yi′′: 1≤i≤

n

2 andE(G) =E(DA(Qn))∪

{vivi′, vivi′′, wiwi′, wiw′′i, xixi′, xix′′i, yiyi′, yiyi′′ : , 1≤i≤

n

2 ∪ {uiu′i, uiu′′i : 1≤i≤ n}. We

consider the following two subcases. Subcase (i) n is even.

Here |V(G)|= 9n and |E(G)|= 10n−1. LetA =0,1,2, . . . ,10n−1

2 . Define a vertex

labeling f : V(G) → A as follows. For 1 ≤ i ≤ n

2, f(u2i−1) = 10(i − 1), f(u2i) =

10i, f(u′

2i−1) = f(wi′) = 10i−9, f(u′2i) = 10i−3, f(u′′2i−1) = 10i−8, f(u′′2i) = f(wi′′) =

10i−1, f(wi) = 10i−4, f(vi) =f(v′′i) = 10i−7, f(vi′) = 10i−8, f(yi) = 10i−2, f(yi′) =

10i−5, f(y′′

i) = 10i−4, f(xi) = f(xi′) = 10i−6, f(x′′i) = 10i−3.

It can be verified that the induced edge labels ofDA(Qn)⊙2K1 are 1,2, . . . ,10n−1 and

|vf(i)−vf(j)| ≤1 for al i, j ∈A.Hencef is a vertex equitable labeling ofDA(Qn)⊙2K1.

Subcase (ii) n is odd.

Here|V(G)|= 9n−6 and|E(G)|= 10n−8.LetA=0,1,2, . . . ,10n−8

2 .Define a vertex

labeling f : V(G)→ A as follows. We label the vertices u2i−1, u′2i−1, u′′2i−1 1≤i≤

n

2

andu2i, u′2i, vi, vi′, wi, wi′, xi, x′i, yi, yi′ 1≤i≤ n−21

as in Subcase (i). It can be verified that the induced edge labels ofDA(Qn)⊙2K1 are 1,2, . . . ,10n−8 and |vf(i)−vf(j)| ≤1 for alli, j ∈A. Hence f is a vertex equitable labeling of DA(Qn)⊙2K1.

Case (ii) The quadrilateral starts fromu2.

We construct DA(Qn) by joining every u2i to vi, xi and u2i+1 is adjacent to wi, yi and vi

is adjacent to wi and xi is adjacent to yi for 1 ≤ i ≤

n−2 2

. Let V(G) = V(DA(Qn))∪

{u′

i, u′′i : 1≤i≤n}∪{vi′, vi′′, wi′, wi′′, x′i, x′′i, y′i, yi′′: 1≤i≤

n−2

2 andE(G) =E(DA(Qn))∪

{viv′

i, vivi′′, wiwi′, wiw′′i, xixi′, xix′′i, yiyi′, yiyi′′: 1≤i≤

n2

2 ∪ {uiu′i, uiu′′i : 1 ≤i≤n}.

Subcase (i) n is even.

Here |V(G)| = 9n−12 and |E(G)| = 10n−15. Let A = 0,1,2, . . . ,10n−15

2 . Define

a vertex labeling f : V(G) → A as follows: For 1 ≤ i ≤ n

2 f(u2i−1) = f(u′′2i−1) =

10i−9, f(u2i) = f(u′2i) = 10i−8, f(u′′2i) = 10i−7, f(u′1) = 0. For 1 ≤ i≤ n−22, f(x′i) =

10i−7, f(wi) = f(wi′) = 10i−2, f(u′′2i+1) = 10i−1, f(vi) = f(yi′) = 10i−6, f(yi′′) =

10i− 3, f(xi) = f(v′′i) = 10i −5, f(yi) = f(w′′i) = 10i, f(vi′) = f(x′′i) = 10i −4. It

can be verified that the induced edge labels of DA(Qn)⊙2K1 are 1,2, . . . , 10n−15 and

|vf(i)−vf(j)| ≤1 for alli, j ∈A.Hencef is a vertex equitable labeling ofDA(Qn)⊙2K1.

Subcase (ii) n is odd.

The proof can be omitted since by symmetry, the graph obtained in this subcase is isomorphic to the graph obtained in Subcase (ii) under Case (i).

An example for the vertex equitable labeling ofDA(Q5)⊙2K1where the two quadrilateral

(8)

Figure 4

Acknowledgement: The authors sincerely thank the referee for the valuable comments to improve the presentation of the paper.

References

[1] F. Harary,Graph theory, Addison Wesley, Massachusetts, 1972.

[2] Joseph A.Gallian, A dynamic survey of graph labeling, The Electronic Journal of

Combinatorics, 17 (2014), # DS6.

[3] A. Lourdusamy and M. Seenivasan, Vertex equitable labeling of graphs, Journal of

Discrete Mathematical Sciences &Cryptography,11(6) (2008), 727–735.

[4] P. Jeyanthi and A. Maheswari, Some Results on Vertex Equitable Labeling, Open

Journal of Discrete Mathematics, 2 (2012), 51–57.

[5] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cycle and path related

graphs, Utilitas Mathematica, 98 (2015), 215–226.

[6] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of transformed trees,Journal

of Algorithms and Computation, 44 (2013), 9–20.

[7] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cyclic snakes and bistar

graphs, Journal of Scientific Research,6(1) (2014), 79–85.

[8] P. Jeyanthi, A. Maheswari and M. Vijayalakshmi, Vertex Equitable Labeling of Cycle

References

Related documents

Movement time (MT), presented as function of 1 level and 2 levels of dissociation between vision and action subtracted from the standard mapping condition (V), for both

Results: With light pressure, the left PSIS moved caudal for hip flexion ≤30° during right-legged stance, whereas the right PSIS moved cephalad relative to the sacral base.. For

Abstract: Originally developed to image the shadow region of the central black hole in Sagittarius A* and in the nearby galaxy M87, the Event Horizon Telescope (EHT) provides deep,

In segmentation processes, the purposes of segmenting the images has been successfully segmented by extracted features based of done.Then this process is for

Instead, roll-back error correction can be used, detect the soft error with an error-detecting code such as parity, and rewriting correct data from a different source.. This

Therefore, the proposed research attempts to fill these identified gaps by investigating the market orientation construct with regard to its emphases, dimensions and performance

FDI have helped India to attain a financial stability and economic growth with the help of investments in different sectors. FDI has boosted the economic life of India

Habitat of Mesoclemmys vanderhaegei observed at the Ecological Station of Santa Barbara, Águas de Santa Bárbara municipality, state of São Paulo, southeastern Brazil..