International Journal of Pure and Applied Mathematics Volume 117 No. 21 2017, 699-708 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu Special Issue ijpam.eu

Total Chromatic Number of Star and BistarGraphs 1D. Muthuramakrishnanand 2G. Jayaraman 1Department of Mathematics, National College, Trichy, Tamil Nadu, India. [email protected] 2Research Scholar, National College, Trichy, Tamil Nadu, India. [email protected]

Abstract A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed 2 the total coloring of 푀 퐾1,푛 , 푇 퐾1,푛 , 퐿 퐾1,푛 and 퐵푛,푛and we obtained the 2 total chromatic number of 푀 퐾1,푛 , 푇 퐾1,푛 , 퐿 퐾1,푛 and 퐵푛,푛. AMS Subject Classification: 05C15 Keywords and Phrases:Middle graph, , total graph, star graph, square graph, total coloring and total chromatic number.

699 International Journal of Pure and Applied Mathematics Special Issue

1. Introduction

In this paper, we have chosen finite, simple and undirected graphs. Let퐺 = (푉 퐺 , 퐸 퐺 ) be a graph with the set 푉(퐺) and the edge set E(퐺), respectively. In 1965, the concept of total coloring was introduced by Behzad [1] and in 1967 he [2] came out new ideology that, the total chromatic number of complete graph and complete bi-partite graph. A total coloring of퐺, is a function 푓: 푆 → 퐶, where 푆 = 푉 퐺 ∪ 퐸 퐺 and C is a set of colors to satisfies the given conditions. (i) no two adjacent vertices receive the same colors (ii) notwo adjacent edges vertices receive the same colors (iii) no edges and its end vertices receive the same colors

The total chromatic number 휒′′ 퐺 of a graph퐺 is the minimumcardinality k such that 퐺may have a total coloring by k colors.Behzad [1] and Vizing [10] conjectured that for every simple graph G has ∆ 퐺 + 1 ≤ 휒′′ (퐺) ≤ ∆ 퐺 + 2, where ∆ 퐺 the maximum of G.This conjecture is called the Total Coloring Conjecture(TCC). Rosenfeld [6] and Vijayaditya [9] verified the TCC, for any graph G with maximum degree ≤ 3 and Kostochka [4] for maximum degree≤ 5.

In Borodin[3] verified the total coloring conjecture (TCC)for maximumdegree ≥ 9 in planar graphs. In 1992, Yap and Chew [11] proved that any graph G has a total coloring withat most∆ 퐺 + 2 colors if∆ 퐺 ≥ 푉 퐺 − 5. In recent era, total coloring have been extensively studied in different families of graphs. Mohan et.al [5] given the tight bound of Behzad and Vizing conjecture for Corona product of certain classes of graph.S.K. Vaidya et.al [8] prove that the total chromatic number of middle graph, total graph, shadow graph of cycle and one point union of cycle. S. Sudha et.al [7] prove that the total chromatic number of Sudha grid graphs, gear graph and crown graph. In this present

paper, we investigate the total chromatic number of 푀 퐾1,푛 , 푇 퐾1,푛 , 퐿 퐾1,푛 2 and 퐵푛,푛 .

2. Total Chromatic Number of푀 퐾1,푛

Definition 2.1. The middle graph of a graph 퐺, denoted by M(퐺) is define as follows, the vertex set of 푀(퐺) is 푉 퐺 ∪ 퐸 퐺 . Two vertices 푥, 푦 in the vertex set of 푀(퐺) are adjacent in 푀(퐺) in case one of the following condition holds: (i) 푥, 푦 are in 퐸(퐺) and 푥, 푦 is adjacent in 퐺. (ii) 푥 is in 푉 퐺 , 푦 is in 퐸 퐺 and 푥, 푦 are incident in 퐺.

Theorem 2.2. Let 푀 퐾1,푛 be the middle graph of star graph. Then 푛 + 2, 푛 푖푠 표푑푑 휒" 푀(퐾 ) = , 1,푛 푛 + 3, 푛 푖푠 푒푣푒푛

700 International Journal of Pure and Applied Mathematics Special Issue

Proof:

Let 푉 퐾1,푛 = 푣 ∪ 푣1 , 푣2 , 푣3 , ...... 푣푛 and E 퐾1,푛 = 푒1 , 푒2 , 푒3 , ...... 푒푛 where {푒푖 = 푣푣푖 : 1 ≤ 푖 ≤ 푛}. Now we construct the middle graph of star, each edge ′ {푒푖 = 푣푣푖 : 1 ≤ 푖 ≤ 푛 } in 퐾1,푛 is subdivided by the vertices {푣푖 ∶ 1 ≤ 푖 ≤ 푛}in ′ ′ ′ ′ 푀(퐾1,푛 ) and the vertices {푣, 푣1, 푣2, 푣3, . . . . . , 푣푛 } induce a clique of order 푛 + 1. Let it be 퐾푛+1. In 푀(퐾1,푛 ), the vertex set and the edge setis given by ′ ′ ′ ′ 푉 푀(퐾1,푛 ) = 푣 ∪ 푣1 , 푣2 , 푣3 , ...... 푣푛 ∪ {푣푖 , 푣2, 푣3, . . . . . , 푣푛 } and ′ ′ ′ ′ 퐸 푀(퐾1,푛 ) = 푣푣푖 ∶ 1 ≤ 푖 ≤ 푛 ∪ 푣푖 푣푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푖 푣푗 ∶ 1 ≤ 푖 ≤ 푛 − 1, 푗>푖, 푖+1≤푗≤푛.Now we define the total coloring 푓, such that푓:푆→퐶 as follows, where푆 = 푉(푀(퐾1,푛 )) ∪ 퐸(푀(퐾1,푛 )) and 퐶 = 1, 2, 3, … . 푛 + 3 . The total coloring is obtained by coloring these vertices and edges as follows. We consider the following two cases:

Case(i): when 푛 is odd ′ 푓 푣 = 푛 + 2 푓 푣푖 = 푖 ∶ 1 ≤ 푖 ≤ 푛. 푓 푣푖 = 푛 + 1 ∶ 1 ≤ 푖 ≤ 푛 2푖, 푖푓 2푖 ≢ 0 푚표푑 푛 + 2 푓 푣푣′ = for 1 ≤ 푖 ≤ 푛 푖 푛 + 2, 0푡ℎ푒푟푤푖푠푒 푖 + 푗, 푖푓 (푖 + 푗) ≢ 0 푚표푑 푛 + 2 푓 푣′ 푣′ = 푖 푗 푛 + 2, 표푡ℎ푒푟푤푖푠푒 for 1 ≤ 푖 ≤ 푛 − 1 , 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 ′ 푓 푣푖 푣푖 = 푖 − 1 ∶ 2 ≤ 푖 ≤ 푛

′ 푓 푣1푣1 = 푛 + 2

Based on the above method of totalcoloring, the graph푀(퐾1,푛 ) is total colored with 푛 + 2colors.

Hence the total chromatic number of 푀(퐾1,푛 ), 휒"(푀(퐾1,푛 )) = 푛 + 2.

Case (ii): when 푛 is even ′ 푓 푣 = 푛 + 3 푓 푣푖 = 푖 ∶ 1 ≤ 푖 ≤ 푛. 푓 푣푖 = 푛 + 1 ∶ 1 ≤ 푖 ≤ 푛 2푖, 푖푓 2푖 ≢ 0 푚표푑 푛 + 3 푓 푣푣′ = for 1 ≤ 푖 ≤ 푛 푖 푛 + 3, 0푡ℎ푒푟푤푖푠푒 푖 + 푗, 푖푓 (푖 + 푗) ≢ 0 푚표푑 푛 + 3 푓 푣′ 푣′ = 푖 푗 푛 + 3, 표푡ℎ푒푟푤푖푠푒 for 1 ≤ 푖 ≤ 푛 − 1 , 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 ′ 푓 푣푖 푣푖 = 푖 − 1 ∶ 2 ≤ 푖 ≤ 푛 ′ 푓 푣1푣1 = 푛 + 2

Based on the above ruleof total coloring, the graph 푀(퐾1,푛 ) is total colored with 푛 + 3colors.Hence the total chromatic number of푀(퐾1,푛 ), 휒"(푀(퐾1,푛 )) = 푛 + 3.

701 International Journal of Pure and Applied Mathematics Special Issue

Illustration 2.3: Consider the middle graph of star

Figure 1: Total Coloring of Middle Graphof Star 푀(퐾1,7) for n is Odd

Illustration 2.4: Consider the middle graph of star

Figure 2: Total Coloring of Middle Graph of Star 푀 퐾1,8 for n is Even

3. Total Chromatic Number of 퐓 퐊ퟏ,퐧

Definition 3.1.The Total graph of a graph 퐺, denoted by 푇(퐺) is define as, the vertex set of 푇(퐺) is 푉 퐺 ∪ 퐸 퐺 . Two vertices 푥, 푦 in the vertex set of 푇(퐺) are adjacent in 푇(퐺) in case one of the following condition holds: (i) 푥, 푦 are in 푉(퐺) and 푥 is adjacent to 푦 in 퐺. (ii) 푥, 푦 are in 퐸(퐺) and 푥, 푦 is adjacent in 퐺. (iii) 푥 is in 푉 퐺 , 푦 is in 퐸 퐺 and 푥, 푦 are incident in 퐺.

Theorem 3.2. Let 푇 퐾1,푛 be the total graph of star graph. Then 휒" 푇(퐾1,푛 ) = 2푛 + 1,

Proof:

Let푉 퐾1,푛 = 푣 ∪ 푣1 , 푣2 , 푣3 , ...... 푣푛 and E 퐾1,푛 = {푒1 , 푒2 , 푒3 , ...... 푒푛 }where {푒푖 = 푣푣푖 : 1 ≤ 푖 ≤ 푛}. Now we construct the total graphof star, each edge ′ {푒푖 = 푣푣푖 : 1 ≤ 푖 ≤ 푛 } in 퐾1,푛 is subdivided by the vertices {푣푖 ∶ 1 ≤ 푖 ≤ 푛}in ′ ′ ′ ′ 푇(퐾1,푛 ) and the vertices {푣, 푣1, 푣2, 푣3, . . . . . , 푣푛 } induce a clique of order 푛 + 1. Let it be 퐾푛+1.

702 International Journal of Pure and Applied Mathematics Special Issue

In 푇(퐾1,푛 ), the vertex set and the edge setis given by 푉 푇(퐾1,푛 ) = 푣 ∪ ′ ′ ′ ′ ′ 푣1 , 푣2 , 푣3 , ...... 푣푛 ∪ {푣1, 푣2, 푣3, . . . . . , 푣푛 } and 퐸 푇(퐾1,푛 ) = 푣푣푖 ∶ 1 ≤ 푖 ≤ 푛 ∪ ′ ′ ′ 푣푣푖 ∶ 1 ≤ 푖 ≤ 푛 ∪ 푣푖 푣푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푖 푣푗 ∶ 1 ≤ 푖 ≤ 푛 − 1, 푗 > 푖, 푖 + 1≤푗≤푛.

Now we define the total coloring 푓, such that푓: 푆 → 퐶 as follows, where 푆 = 푉(푇(퐾1,푛 )) ∪ 퐸(푇(퐾1,푛 )) and 퐶 = 1, 2, 3, … .2푛 + 1 . The total coloring is obtained by coloring these vertices and edges as follows. ′ 푓 푣 = 2푛 + 1 푓 푣푖 = 푖 ∶ 1 ≤ 푖 ≤ 푛. 푓 푣푖 = 2푛 ∶ 1 ≤ 푖 ≤ 푛 2푖, 푖푓 2푖 ≢ 0 푚표푑 2푛 푓 푣푣′ = for 1 ≤ 푖 ≤ 푛 푖 2푛, 0푡ℎ푒푟푤푖푠푒 2푖 − 1, 푖푓 2푖 − 1 ≢ 0 푚표푑 2푛 − 1 푓 푣푣 = for 1 ≤ 푖 ≤ 푛 푖 2푛 − 1, 0푡ℎ푒푟푤푖푠푒 푖 + 푗, 푖푓 (푖 + 푗) ≢ 0 푚표푑 2푛 + 1 푓 푣′ 푣′ = 푖 푗 2푛 + 1, 표푡ℎ푒푟푤푖푠푒 for 1 ≤ 푖 ≤ 푛 − 1 , 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 ′ 푓 푣푖 푣푖 = 푖 − 1 ∶ 2 ≤ 푖 ≤ 푛 ′ 푓 푣1푣1 = 푛 + 2

Based on the above rule of total coloring, the graph 푇(퐾1,푛 ) is total colored with 2푛 + 1colors. Hence the total chromatic number of the total graph of 푇(퐾1,푛 ), 휒"(푇(퐾1,푛 )) = 2푛 + 1.

Illustration 3.3: Consider the total graph of Star graph

Figure 3: Total Coloring of Total Graph of Star 푇(퐾1,8)

4. Total Chromatic Number of퐿(퐵푛,푛 )

Definition 4.1. Bistar graph is the graph obtained by joining the root vertices of two copies of star 퐾1,푛

Definition 4.2. The line graph of graph 퐺, denoted by L(퐺) is the graph whose vertices are the edges of 퐺, (iii) 푥 is in 푉 퐺 , 푦 is in 퐸 퐺 and 푥, 푦 are incident in 퐺.

703 International Journal of Pure and Applied Mathematics Special Issue

Theorem4.3. Let 퐿 퐵푛,푛 be the line graph of star graph. Then 휒" 퐿(퐵푛,푛 ) = 2푛 + 1,

Proof:

Let 푉 퐵푛,푛 = 푢 ∪ 푣 ∪ 푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푖 : 1 ≤ 푖 ≤ 푛 and E 퐵푛,푛 = ′ 푢푢푖: 1 ≤ 푖 ≤ 푛 ∪ 푣푣푖 : 1 ≤ 푖 ≤ 푛 ∪ 푢푣 . Let푢푖 (1 ≤ 푖 ≤ 푛) be the edge ′ ′ between the vertices 푢 and 푢푖(1 ≤ 푖 ≤ 푛) (i.e) 푢푢푖 = 푢푖 and 푣푖 (1 ≤ 푖 ≤ 푛) be ′ ′ the edge between the vertices 푣 and 푣푖 (1 ≤ 푖 ≤ 푛) (i.e) 푣푣푖 = 푣푖 and 푢 be the edge between the vertices 푢 and 푣. Here 푢′ is adjacent with both the vertices ′ ′ 푢푖 (1 ≤ 푖 ≤ 푛) and 푣푖 1 ≤ 푖 ≤ 푛 .Now we construct the line graph of Bistar, the edge set of 퐵푛,푛 corresponding to the vertex set of 퐿(퐵푛,푛 ). The vertices ′ ′ 푢푖 (1 ≤ 푖 ≤ 푛) along with 푢 forms a complete graph of order 푛 + 1 and also ′ ′ the vertices 푣푖 (1 ≤ 푖 ≤ 푛) along with 푢 forms a complete graph of order ′ ′′ 푛 + 1. Let it be 퐾푛+1 and 퐾푛+1. In 퐿 퐵푛,푛 , the vertex set and the edge set is given by

′ ′ ′ 푉 퐿 퐵푛,푛 = {푢푖 ∶ 1 ≤ 푖 ≤ 푛} ∪ {푣푖 ∶ 1 ≤ 푖 ≤ 푛} ∪ {푢 } and ′ ′ ′ ′ 퐸 퐿 퐵푛,푛 = 푢 푢푖 ∶ 1 ≤ 푖 ≤ 푛 ∪ 푢 푣푖 ∶ 1 ≤ 푖 ≤ 푛 ′ ′ ∪ 푢푖 푢푗 ∶ 1 ≤ 푖 ≤ 푛 − 1 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 ∪ ′ ′ 푣푖 푣푗 ∶ 1 ≤ 푖 ≤ 푛 − 1, 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 .

Now weconstruct the total coloring 푓, such that푓: 푆 → 퐶 as follows, where

푆 = 푉 퐿 퐵푛,푛 ∪ 퐸 퐿 퐵푛,푛 and퐶 = 1, 2, 3, … .2푛 + 1 . The total coloring is obtained by coloring these vertices and edges as follows. 푓 푢′ = 2푛 + 1 푖, 푖푓 푖 ≢ 0 푚표푑 푛 푓 푢′ = for 1 ≤ 푖 ≤ 푛 푖 푛, 0푡ℎ푒푟푤푖푠푒 푛 + 푖, 푖푓 푛 + 푖 ≢ 0 푚표푑 2푛 푓 푣′ = for 1 ≤ 푖 ≤ 푛 푖 2푛, 0푡ℎ푒푟푤푖푠푒 2푖, 푖푓 2푖 ≢ 0 푚표푑 2푛 푓 푢′ 푢′ = for 1 ≤ 푖 ≤ 푛 푖 2푛, 0푡ℎ푒푟푤푖푠푒 2푖 − 1, 푖푓 2푖 − 1 ≢ 0 푚표푑 2푛 − 1 푓 푢′ 푣′ = for 1 ≤ 푖 ≤ 푛 푖 2푛 − 1, 0푡ℎ푒푟푤푖푠푒 푖 + 푗, 푖푓 (푖 + 푗) ≢ 0 푚표푑 2푛 + 1 푓 푢′ 푢′ = 푖 푗 2푛 + 1, 표푡ℎ푒푟푤푖푠푒 for 1 ≤ 푖 ≤ 푛 − 1 , 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛 푖 + 푗 − 1, 푖푓 (푖 + 푗 − 1) ≢ 0 푚표푑 2푛 + 1 푓 푣′ 푣′ = 푖 푗 2푛 + 1, 표푡ℎ푒푟푤푖푠푒 for 1 ≤ 푖 ≤ 푛 − 1 , 푗 > 푖, 푖 + 1 ≤ 푗 ≤ 푛

It is clear that, the above rule of total coloring, the graph퐿 퐵푛,푛 is total colored with 2푛 + 1colors.

704 International Journal of Pure and Applied Mathematics Special Issue

Hence the total chromatic number of 퐿 퐵푛,푛 , 휒" 퐿 퐵푛,푛 = 2푛 + 1.

Illustration 4.4: Consider the line graph of Bistar graph

Figure 4: Bistar Graph 퐵3,3 and Total Coloring of Line Graph of Bistar 퐿 퐵5,5

2 5. Total Chromatic Number of퐵푛,푛

Definition 5.1. For a simple connected graph 퐺, the square graph퐺, is the graph 퐺2 obtained by adding edges to 퐺 between any two vertices of 퐺 is 2.

2 Theorem 5.2. Let퐵푛,푛 be the square graph of Bistar graph. Then 2 휒" 퐵푛,푛 = 2푛 + 2, 푛 ≥ 2.

Proof:

Let 푉 퐵푛,푛 = 푢 ∪ 푣 ∪ 푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푖 : 1 ≤ 푖 ≤ 푛 and

E 퐵푛,푛 = 푢푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푣푖: 1 ≤ 푖 ≤ 푛 ∪ 푢푣 . Now we construct the 2 square graph of Bistar graph, the new edges in 퐵푛,푛 is obtained by adding the 2 edges to 퐵푛,푛 between any two vertices of 퐵푛,푛 of distance two. In 퐵푛,푛 , the vertex set and the edge set is given by

2 푉 퐵푛,푛 = 푢 ∪ 푣 ∪ 푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푖 : 1 ≤ 푖 ≤ 푛 and 2 퐸 퐵푛,푛 = 푢푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푢푣푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푢푖 : 1 ≤ 푖 ≤ 푛 ∪ 푣푣푖 : 1 ≤ 푖 ≤ 푛 Now we construct the total coloring 푓, such that푓: 푆 → 퐶 as follows, where 2 2 푆 = 푉 퐵푛,푛 ∪ 퐸 퐵푛,푛 and 퐶 = 1, 2, 3, … .2푛 + 2 . The total coloring is obtained by coloring these vertices and edges as follows. 푓 푢 = 1 푓 푣 = 2푛 + 1 푓 푢푖 = 푓 푣푖 = 푓 푢푣 = 2푛 + 2 ∶ 1 ≤ 푖 ≤ 푛

705 International Journal of Pure and Applied Mathematics Special Issue

2푖, 푖푓 2푖 ≢ 0 푚표푑 2푛 푓 푢푢 = for 1 ≤ 푖 ≤ 푛 푖 2푛, 0푡ℎ푒푟푤푖푠푒 2푖 + 1, 푖푓 2푖 + 1 ≢ 0 푚표푑 2푛 + 1 푓 푢푣 = for 1 ≤ 푖 ≤ 푛 푖 2푛 + 1, 0푡ℎ푒푟푤푖푠푒 2푖 − 1, 푖푓 2푖 − 1 ≢ 0 푚표푑 2푛 − 1 푓 푣푢 = for 1 ≤ 푖 ≤ 푛 푖 2푛 − 1, 0푡ℎ푒푟푤푖푠푒 2푖, 푖푓 2푖 ≢ 0 푚표푑 2푛 푓 푣푣 = for 1 ≤ 푖 ≤ 푛 푖 2푛, 0푡ℎ푒푟푤푖푠푒

2 It is clear that, the above rule of total coloring, the graph퐵푛,푛 is total colored 2 2 with 2푛 + 2colors. Hence the total chromatic number of퐵푛,푛 , 휒" 퐵푛,푛 = 2푛 + 2.

Illustration 5.3: Consider the square graph of Bistar graph.

2 Figure 5: Bistar Graph 퐵3,3 and Total Coloring of Square Graph of Bistar 퐵6,6 References [1] Behzad M., Graphs and their chromatic numbers, Doctoral Thesis, Michigan State University (1965). [2] Behzad M., Chartrand G., Cooper J.K., The color numbers of complete graphs, Journal London Math. Soc. 42(1967), 226-228. [3] Borodin O.V., On the total coloring planar graphs, J. Reine Angew Math. 394(1989),180-185. [4] Kostochka A.V., the total coloring of a multigraph with maximal degree 4, Discrete Math 17 (1989), 161-163. [5] Mohan S., Geetha J., Somasundaram K., Total coloring of Corona Product of two graphs, Australasian Journal of Combinatorics 68 (2017), 15-22. [6] RosanfeldM., On the total colouring of certain graphs, Israel J. Math. 9 (1972), 396-402.

706 International Journal of Pure and Applied Mathematics Special Issue

[7] Sudha S., Manikandan K., Total coloring of S(n. m) graph., International Journal of Scientific and Innovative Mathematical Research, 2(1) (2014), 16-22. [8] Vaidya S.K., Rakhimol V. Isaac, Total Coloring of Some Cycle Related Graphs, ISOR Journal Mathematics 11(3) (2015), 51-53. [9] Vijayaditya N., On total chromatic number of a graph, J. London Math Soc. (1971), 405-408. [10] Vizing V.G., Some unsolved problems in , Russian Mathematical Survey 23(6) (1968), 125-141. [11] Yap H.P., Chew K.H., The chromatic number of graphs of high degree II, J. Austral. Math. Soc. 47(1989), 445-452. [12] Surendar, A., Arun, M., Periasamy, P.S.”Hardware based algorithms for bioinformatics applications - A survey”,(2013) International Journal of Applied Engineering Research, 8 (6), pp. 745-754. [13] B. Saichandana, G. Rachana sri, A. Surendar and B. Suniltej “controlling of wall lamp using arduino”, International Journal of Pure and Applied Mathematics, Volume 116 No. 24 2017, 349- 354, ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on- line version) [14] A. Surendar and Usha Rani Nelakuditi, “Editorial - New Developments in Electronics, Cloud and IoT”, Electronic Government, An International Journal, Vol. 13, No. 4, 2017, ISSN online: 1740-7508 ISSN print: 1740-7494,pp -287-289

707 708