Total Mean Cordiality ofk c n + 2K 2
|
|
- Eugene Freeman
- 5 years ago
- Views:
Transcription
1 Palestine Journal of Mathematics Vol () (15), 1 8 Palestine Polytechnic University-PPU 15 Total Mean Cordiality ofk c n + K R Ponraj and S Sathish Narayanan Communicated by Ayman Badawi MSC 1 Classifications: 5C78 Keywords and phrases: Path, Cycle, Wheel, Complete graph, Complete bipartite graph Abstract A Total Mean Cordial labeling of a graph G = (V,E) is a mapping f : V(G) {, 1, } such that f(xy) = where x,y V(G), xy G, and the total number of f(x)+f(y), 1 and are balanced That is ev f (i) ev f (j) 1, i,j {, 1, } where ev f (x) denotes the total number of vertices and edges labeled with x (x =, 1, ) If there exists a total mean cordial labeling on a graph G, we will call G is Total Mean Cordial In this paper, it is shown that K c n + K is Total Mean Cordial iff n = 1 or or or 6 or 8 1 Introduction By a graph we mean a finite unoriented graph without loops and multiple edges A general reference for graph theoretic ideas can be seen in [] A vertex labeling of a graph G is an assignmentf of labels to the vertices ofgthat induces for each uv E(G) a label depending on the vertex labels f(u) and f(v) The vertex and edge set of a graph G are denoted by V(G) and E(G) so that the order and size of G are respectively V(G) and E(G) Let G 1 and G be two graphs with vertex setsv 1 and V and edge sets E 1 and E respectively Then their join G 1 +G is the graph whose vertex set is V 1 V and edge set is E 1 E {uv : u V 1 and v V } The notion of Total Mean cordial labeling was introduced and studied by Ponraj, Ramasamy and Sathish Narayanan [] Let f be a function from V(G) {, 1, } For each edge uv, assign the label f(u)+f(v) f is called a Total Mean Cordial labeling if ev f (i) ev f (j) 1 where ev f (x) denote the total number of vertices and edges labeled with x (x =, 1, ) A graph with a Total Mean Cordial labeling is called Total Mean Cordial graph In this paper, we investigate the Total Mean Cordial labeling behaviour of K c n + K Let x be any real number Then the symbol x stands for the largest integer less than or equal to x and x stands for the smallest integer greater than or equal to x Main result Theorem 1 K c n + K is Total Mean Cordial if and only if n = 1 or or or 6 or 8 Proof Let V(K c n + K ) = {u,v,x,y,u i : 1 i n} and E(K c n + K ) = {uv,xy,} {uu i,vu i,xu i,yu i : 1 i n} It is clear that V(G) + E(G) = 5n+6 Let l denotes the number of zeros to be used in u i (1 i n) and that for the label, we use r Suppose f is a Total Mean Cordial labeling of K c n + K Case 1 n (mod ) Let n = t Then V(G) + E(G) = 15t + 6 Here ev f () = ev f (1) = ev f () = 5t + Consider the set S = {u,v,x,y} and the label Here there are five possible cases * All the four vertices of S are labeled by * Any three of them are labeled by * Any two of them are labeled with [This may be adjacent vertices or two non adjacent vertices] * Only one vertex is labeled by * None of them received the label Now we discuss all the cases given above Subcase 1 f(u)=f(v) = f(x) = f(y)=
2 R Ponraj and S Sathish Narayanan Here, ev f () t, a contradiction Subcase f(u), f(v), f(x), f(y) In this case ev f () t, a contradiction Subcase Any three of them are labeled with zero With out loss of generality assume that f(u) = f(v) = f(x) = and f(y) So the vertices in S contributes only zeros We should utilize the remaining 5t zeros for both vertices and edges In this case, if u i is labeled with, apart from this label, each vertex u i contributes zeros So we havel+l = 5t Thereforel = 5t This is possible only whent (mod ) Now consider the label Suppose f(y) = then r + r + 1 = 5t+ This implies r = 5t+1, a contradiction since t (mod ) Suppose f(y) = 1 Then r = 5t+ But l + r > t, a contradiction Subcase Any two vertices from S are labeled by zero First we assume that any two adjacent vertices in u, v, x, y are labeled with zero Without loss of generality we assume that f(u) = f(v) = and f(x), f(y) At present we have used zeros In this case each u i contributes two edges with label zero So,l+ l+ = 5t+ That is l = 5t 1 Such a positive integer l exists only if t (mod ) Suppose t (mod ) Consider the label If f(x) = f(y) = Then r = 5t 1 It is clear that l + r t This is true only when t Since t (mod ), t 1 If t =, the following figure 1 shows that K6 c + K is Total Mean Cordial Figure 1 Suppose f(x) =, f(y) = 1 In this case r + r + = 5t + That is r = 5t Since t (mod ), such a postive integerr does not exists Iff(x) = f(y) = 1 thenr+ r = 5t+ Hence r = 5t+ Then l+r > t, a contradiction Now consider the case, zero is labeled with any two non adjcent vertices from the set S Without loss of generality assume that f(u) = and f(y)= Here, l+l+ = 5t+ Thereforel = 5t This is true only if t (mod ) If f(v) = f(y) = then in this case r+r + = 5t+ This implies r = 5t Here l +r > t, a contradiction Suppose f(v) = 1, f(y) = Here r + r + 1 = 5t + Then r = 5t+1 Since t (mod ), r can not be a positive integer Assume that f(v) = f(y) = 1 In this case r+ r = 5t+ This implies r = 5t+ Since t (mod ), r is not a positive integer Subcase 5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u) = In this case each vertex u i contributes one edge with label zero Hence l+l+1 = 5t+ That is l = 5t+1 Since l is an positive integer, t 1 (mod ) Now assume f(x) = f(y) = f(v) = Then r + r + = 5t+ Therefore r = 5t Since t 1 (mod ), r can not be a positive integer Suppose f(x) = f(y) = f(v) = 1 In this case, r+r = 5t+ Hence r = 5t+ Since t 1 (mod ), r can not be a positive integer If f(x) = f(y)= 1 and f(v) = Then r+ r+ 1 = 5t+ That isr = 5t+1 Again a contradiction sincel+r > t Forf(x) = 1 andf(y) = f(v) =, we haver+ r+ = 5t+ Hence r = 5t, a contradiction since t 1 (mod ) If f(v) = 1 and f(x) = f(y) = then r + r + = 5t + That is r = 5t 1 It follows that l + r > t, a contradiction Suppose f(v) = f(x) = 1 and f(y)= In this case r+r+ = 5t+ Hence r = 5t a contradiction since t 1 (mod ) Case n 1(mod )
3 Total Mean Cordiality of K c n + K Let n = t+1 Then V(G) + E(G) = 15t+11 Here we have three possibilities a ev f () = ev f () = 5t+, ev f (1) = 5t+ or b ev f () = ev f (1) = 5t+, ev f () = 5t+ or c ev f (1) = ev f () = 5t+, ev f () = 5t+ Suppose ev f () = ev f () = 5t+, ev f (1) = 5t+ Subcase a1 f(u)=f(v) = f(x) = f(y)= Here, ev f () t+1, a contradiction Subcase a f(u), f(v), f(x), f(y) In this case ev f () t+1, a contradiction Subcase a Any three vertices of S are labeled with zero With out loss of generality assume thatf(u) = f(v) = f(x) = and f(y) Here, if a vertex u i is labeled with zero then it contributes three edges with label zero So we have l + l + = 5t+ Thereforel = 5t Such a positive integerlexisits only whent (mod ) Now suppose f(y) = A vertex u i with label contributes one edge with label So r + r + 1 = 5t + That is r = 5t+ Since t (mod ), r can not be a positive integer If f(y) = 1 then in this case also a vertex u i with label contributes one edge with label Therefore r + r = 5t+ That is r = 5t+ But l+r > t+1, a contradiction Subcase a Any two vertices of S are labeled with zero First we assume that f(u) = f(v) = and f(x), f(y) In this case, if a vertex u i is labeled by zero then it gives two edges with label zero Therefore l+l+ = 5t+ That is l = 5t+1 Since l is a positive integer, t 1 (mod ) Consider the vertices x and y Suppose these two vertices are labeled with 1 If a vertex u i is labeled by then each u i contributes two edges with labele It follows that r + r = 5t + Hence r = 5t+ But l + r > t + 1, a contradiction Suppose the vertices x and y are labeled by Here a vertex u i with label contributes two edges with label Then r + r + = 5t + Therefore, r = 5t+1 We know that l + r t + 1 This is true only when t = 1 The Total Mean Cordial labeling of K c + K is given in figure Suppose f(x) = 1 and f(y) = Then each vertex u i with a Figure label contributes two edges with label This impliesr+ r+ = 5t+ and hence r = 5t+ Since t 1 (mod ), such a positive integer r does not exists Suppose f(u) = f(x) = Here l + l + = 5t + Therefore l = 5t+ It follows that t (mod ) Now assume f(y) = f(v) = Thenr+r+ = 5t+ That isr = 5t+ Butl+r > t+1, a contradiction If f(y) = f(v) = 1 then r+ r = 5t+ Hence r = 5t+, a contradiction since t (mod ) Forf(y)=1 andf(v) =, we haver+ r+ 1 = 5t+ That isr = 5t+, again a contradiction since t (mod ) Subcase a5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u) = In this case l + l + 1 = 5t + and hence l = 5t+ Since l is a positive integer, t 1 (mod ) If f(v) = f(x) = f(y) = 1 then r+r = 5t+ This impliesr = 5t+ For the values oft,r could not be an integer Iff(v) = 1 and f(x) = f(y) = then r + r + = 5t + Therefore r = 5t+1 Here, l + r > t + 1, a contradiction If f(v) = and f(x) = f(y) = 1 then r + r + 1 = 5t + This implies r = 5t+ Here also l+r > t+1, a contradiction Suppose f(v) = f(x) = 1 and f(y) = Here r + r + = 5t + and hence r = 5t+ This is impossible since t 1 (mod ) For f(v) = f(x) = f(y)=, we have r+r+ = 5t+ Thereforer = 5t But t 1(mod ), a contradiction
4 R Ponraj and S Sathish Narayanan Consider the case ev f () = ev f (1) = 5t+ and ev f () = 5t+ Subcase b1 f(u)=f(v) = f(x) = f(y)= Here, ev f () t+1, a contradiction Subcase b f(u), f(v), f(x), f(y) In this case ev f () t+1, a contradiction Subcase b Any three vertices of S are labeled with zero With out loss of generality assume that f(u) = f(v) = f(x) = and f(y) In this case l+l+ = 5t+ That isl = 5t Sincel is a positive integer,t (mod ) Supposef(y)= then r + r + 1 = 5t+ Therefore r = 5t+ But l + r t+1 This is true only if t = A Total Mean Cordial labeling of K1 c + K is given in figure For f(y) = 1, r+r = 5t+ Figure Therefore r = 5t+ This is a contradiction to t (mod ) Subcase b Any two vertices of S are labeled with zero First we assume that f(u) = f(v) = and f(x), f(y) Then l+l+ = 5t+ This implies l = 5t+1 It follows that t 1(mod ) Now assume that f(x) = f(y) = In this case r + r + = 5t+ Then r = 5t, a contradiction to t 1 (mod ) If f(x) = f(y) = then r+ r = 5t+ and hence r = 5t+ This is impossible since t 1 (mod ) For f(x) = 1 and f(y) =, we haver+r+ = 5t+ Thenr = 5t+1 Butl+r t+1 This is true only when t 1 Since t 1 (mod ), t For t = 1, the Total Mean Cordial labeling of K c + K is given in figure Suppose f(u) = f(x) = and f(v), f(y) Then l+l+ = 5t+ 1 Figure and therefore l = 5t+ It follows that t (mod ) Consider the vertices v and y Suppose these two vertices are labeled by then r + r + = 5t + So we have r = 5t+1 Since t (mod ), such a positive integer does not exists Suppose v and y are labeled by 1 In this case r+r = 5t+ and hence r = 5t+ This is impossible since t (mod ) If f(v) = 1 and f(y)=then r+r+1 = 5t+ That is r = 5t+ But l+r > t+1 a contradiction Subcase b5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u)= In this case l+l+ 1 = 5t+ Thus l = 5t+ This is true only ift 1(mod ) Supposef(v) = f(x) = f(y)= Herer+ r+ = 5t+ Then r = 5t 1 But l + r > t + 1, a contradiction If f(v) = f(x) = f(y) = 1 then r + r = 5t + and hence r = 5t+ In this case l + r > t + 1, a contradiction Suppose f(v) = and f(x) = f(y) = 1 Here r+r+1 = 5t+ Thus r = 5t+ This is impossible since t 1 (mod ) For f(v) = f(y) = and f(x) = 1, we have r + r + = 5t + This implies r = 5t, a contradiction to t 1 (mod ) If f(v) = 1 and f(x) = f(y) = then r+r+ = 5t+ Hencer = 5t Again a contradiction tot 1(mod ) Forf(v) = f(x) = 1 and f(y)=, r+ r+ = 5t+ Therefore r = 5t+1 But l+r > t+1, a contradiction Suppose ev f (1) = ev f () = 5t+ and ev f () = 5t+
5 Total Mean Cordiality of K c n + K 5 Subcase c1 f(u) = f(v) = f(x) = f(y)= Here, ev f () t+1, a contradiction Subcase c f(u), f(v), f(x), f(y) In this case ev f () t+1, a contradiction Subcase c Any three vertices of S are labeled with zero With out loss of generality assume that f(u) = f(v) = f(x) = and f(y) Here l + l + = 5t + Thus l = 5t 1 This implies t 1 (mod ) Now assume f(y) = Then r+r+ 1 = 5t+ Hence r = 5t+ But l+r > t+1, a contradiction Forf(y)=, we have r+r = 5t+ This implies 5t+ This is a contradiction to t 1 (mod ) Subcase c Any two vertices of S are labeled with zero Assume f(u) = f(v) = and f(x), f(y) In this case l+l+ = 5t+ Therefore l = 5t Such a positive integer l exists only if t is a multiple of Suppose f(x) = f(y) = thenr+ r+ = 5t+ Thusr = 5t+1 This shows thattis not a multiple of, a contradiction If f(x) = f(y) = 1 then r + r = 5t + Therefore r = 5t+ Since t (mod ), such a positive integer r does not exists Suppose f(x) = 1 and f(y) = then r + r + = 5t+ Therefore r = 5t+, a contradiction since t (mod ) Consider the case f(u) = f(x) = and f(v) f(y) Here l+ l+ = 5t+ Thus l = 5t+1 It follows that t 1 (mod ) Suppose f(v) = f(y) = then r + r + = 5t+ Hence r = 5t+ Since t 1 (mod ), r could not be a positive integer If f(v) = f(y) = 1 then r + r = 5t+ Therefore r = 5t+ But l +r > t+1, a contradiction For f(v) = 1 and f(y) =, we have r+r + 1 = 5t+ and hence r = 5t+, a contradiction since t 1 (mod ) Subcase c5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u)= Here, l+l+1 = 5t+ and hence l = 5t+ It follows that t (mod ) Now assume f(v) = f(x) = f(y) = Then r+ r+ = 5t+ This implies r = 5t But l+r t+1 This is true only when t = Kc 1 + K with a Total Mean Cordial labeling is given in figure 5 Suppose f(v) = f(x) = f(y) = 1 In this case Figure 5 r + r = 5t + Therefore r = 5t+ But l + r > t + 1, a contradiction If f(v) = and f(x) = f(y)=1then r+ r+ 1 = 5t+ That is r = 5t+ Such a positive integer r does not exists since t (mod ) Assume f(v) = f(y)= and f(x) = 1 Here r+r+ = 5t+ Then r = 5t+1 This is a contradiction to t (mod ) If f(x) = f(y) = and f(v) = 1 then r + r+ = 5t+ and hence r = 5t+1 Here also a contradiction arises since t (mod ) Further if f(v) = f(x) = 1 and f(y) = then r + r + = 5t+ Therefore r = 5t+ But l+r > t+1, a contradiction Case n (mod ) Let n = t + Then V(G) + E(G) = 15t + 16 In this case we have three possibilities a ev f () = ev f (1) = 5t+5, ev f () = 5t+6 or b ev f () = ev f () = 5t+5, ev f (1) = 5t+6 or c ev f (1) = ev f () = 5t+5, ev f () = 5t+6 Suppose ev f () = ev f (1) = 5t+5, ev f () = 5t+6 Subcase a1 f(u)=f(v) = f(x) = f(y)= Here, ev f () t+, a contradiction Subcase a f(u), f(v), f(x), f(y) In this case ev f () t+, a contradiction Subcase a Any three vertices of S are labeled with zero With out loss of generality assume thatf(u)= f(v)= f(x) = andf(y) Thenl+l+ = 5t + 5 That is l = 5t+1 It follows that t (mod ) Suppose f(y) = In this case r+r+1 = 5t+6 This implies r = 5t+5 Here, l+r > t+, a contradiction For f(y) = 1, we have r+r = 5t+6 and hence r = 5t+6 This is impossible since t (mod )
6 6 R Ponraj and S Sathish Narayanan Subcase a Any two vertices of S are labeled with zero Assume f(u) = f(v) = and f(x), f(y) Here, l + l + = 5t + 5 This implies l = 5t+ It follows that t (mod ) Now consider the vertices x and y Suppose these two vertices are labeled by then r + r + = 5t + 6 Hence r = 5t+, a contradiction to the nature of t If f(x) = f(y) = 1 then r + r = 5t + 6 Therefore r = 5t+6 Here also a contradiction arises to the values of t Now we consider the case that f(x) = 1 and f(y) = In this case r + r + = 5t+6 That is r = 5t+, a contradiction to t (mod ) Now we consider the case f(u) = f(x) = and f(v), f(y) In this case l + l + = 5t+5 and hence l = 5t+ This shows that t should be a multiple of If f(v) = f(y) = Then r+r+ = 5t+6 Hencer = 5t+, a contradiction to the values oft Assumef(v) = f(y) = 1 Here r+r = 5t+6 and then r = 5t+6 But l+r > t+, a contradiction Supposef(v) = 1, f(y) = then r+r + 1 = 5t+6 That is r = 5t+5 Such a positive integer r does not exists since t (mod ) Subcase a5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u) = Then l + l + 1 = 5t + 5 and therefore l = 5t+ This is possible only when t is a multiple of If f(v) = f(x) = f(y) = then r + r + = 5t + 6 Therefore r = 5t+ But l + r > t +, a contradiction Suppose f(v) = f(x) = f(y) = 1 then r + r = 5t+6 and hence r = 5t+6 Here also l+r > t+, a contradiction For the case f(v) = and f(x) = f(y) = 1, we have r + r + 1 = 5t + 6 and therefore r = 5t+5 This is impossible since t (mod ) Assume f(v) = f(y) = and f(x) = 1 Herer+ r+ = 5t+6 Thereforer = 5t+ Here also a contradiction to the nature oft Iff(v) = 1 andf(x) = f(y)= thenr+r+ = 5t+6 Hencer = 5t+, a contradiction to t (mod ) Assume f(v) = f(x) = 1 and f(y) = Here r+r + = 5t+6 That is r = 5t+ But l+r > t+, a contradiction Assume ev f () = ev f () = 5t+5, ev f (1) = 5t+6 Subcase b1 f(u)=f(v) = f(x) = f(y)= Here, ev f () t+, a contradiction Subcase b f(u), f(v), f(x), f(y) In this case ev f () t+, a contradiction Subcase b Any three vertices of S are labeled with zero With out loss of generality assume thatf(u)= f(v)= f(x) = andf(y) Thenl+l+ = 5t + 5 This implies l = 5t+1 This is true only if t (mod ) Suppose f(y) = then r+r+1 = 5t+5and therefore r = 5t+, a contradiction to the values of t For f(y) = 1, we have, r+r = 5t+5 and hence r = 5t+5 But l+r > t+, a contradiction Subcase b Any two vertices of S are labeled with zero Assume f(u) = f(v) = and f(x), f(y) Then l + l + = 5t + 5 and therefore l = 5t+ It follows that t (mod ) Now consider the vertices x and y Suppose both of this two vertices are Simultaneously labeled by Here r + r + = 5t + 5 Therefore r = 5t+ Clearly the value of l+r should be less than or equal to t+ This should be true only if t But we discussed earlier that t is a multiple of and t is a positive integer Hence t and t 1 For t =, we display a Total Mean Cordial labeling of K c 8 + K in figure 6 Assume f(x) = f(y) = 1 Then r + r = 5t + 5 and therefore r = 5t+5 But l + r > t +, a contradiction Suppose f(u) = f(x) = and f(v), f(y), then l+ l+ = 5 5t+ t + 5 This implies l = It follows that t is a multiple of Iff(v) = f(v) = thenr+r+ = 5t+5 and hnecer = 5t+ Nowl+r should not exceed t+ This is possible only if t This implies t = A Total Mean Cordial labeling of K c+ K is given in figure 7 For f(v) = f(y) = 1 we have r + r = 5t+5 Hence r = 5t+5 This is a contradiction to the values of t Assume f(v) = 1 and f(y) = In this case r+ r+1 = 5t+5 and therefore r = 5t+ This is also a contradiction to the nature of t Subcase b5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u) = Here l + l + 1 = 5t + 5 That is l = 5t+ This implies t is a multiple of Now assume f(v) = f(x) = f(y) = Then r + r + = 5t + 5 and hence r = 5t+1 Since t is a multiple of, r is not an integer, a contradiction If f(v) = f(x) = f(y) = 1 then r + r = 5t + 5 This implies r = 5t+5 For the same reason as discussed above, we have a contradiction For f(v) = and f(x) = f(y) = 1, we have r + r + 1 = 5t + 5 Therefore 5t+ Now l + r > t +, a contradiction If f(x) = 1 and f(v) = f(y) = then r + r + = 5t + 5 That is r = 5t+ Here also the value of l + r exceeds t +, a contradiction Consider the case when f(v) = 1 and f(x) = f(y) = In this case r+r + = 5t+5 Therefore r = 5t+ Again l +r > t+, a contradiction For f(v) = f(x) = 1 and f(y) = we have r+ r+ = 5t+5 Hence r = 5t+ Such a positive
7 Total Mean Cordiality of K c n + K 7 Figure 6 Figure 7 integer r does not exists since t is a multiple of Consider the case ev f () = 5t+6 and ev f () = ev f (1) = 5t+5 Subcase c1 f(u) = f(v) = f(x) = f(y)= Here, ev f () t+, a contradiction Subcase c f(u), f(v), f(x), f(y) In this case ev f () t+, a contradiction Subcase c Any three vertices of S are labeled with zero With out loss of generality assume thatf(u)=f(v) = f(x) = andf(y) Herel+l+ = 5t + 6 That is l = 5t+ It follows that t (mod ) Now consider the vertex y Suppose f(y) = then r+r+ 1 = 5t+5 and hence r = 5t+ But l+r > t+, a contradiction For f(v) = 1 we have r+r = 5t+5 therefore r = 5t+5, a contradiction to the values of t Subcase c Any two vertices of S are labeled with zero Assume f(u) = f(v) = and f(x), f(y) In this case l + l + = 5t + 6 This implies l = 5t+ It follows that t is a multiple of Assume f(x) = f(y) = Then r+r+ = 5t+5 That isr = 5t+ Such a positive integerrdoes not exists sincet (mod ) If f(x) = f(y) = 1 then r + r = 5t+5 Hence r = 5t+5 Suppose f(x) = 1, f(y) = In this case r + r + = 5t+5 and hence r = 5t+ Now l +r t+ This is possible only when t = A Total Mean Cordial labeling of K c + K is given in figure 8 Consider the case 1 Figure 8
8 8 R Ponraj and S Sathish Narayanan f(u) = f(x) = andf(v),f(y) In this casel+l+ = 5t+6 This impliesl = 5t+ It follows that t 1 (mod ) Next consider the vertices v and y If possible f(v) = f(y) = then r+r+ = 5t+5 and hence r = 5t+ This is impossible since t 1 (mod ) Suppose f(v) = f(y) = 1 Here r+r = 5t+5 Therefore r = 5t+5, a contradiction to the values of t For f(v) = 1 and f(y) = we have r+r+1 = 5t+5 Then r = 5t+ But l+r > t+, a contradiction Subcase c5 Only one vertex from the set S is labeled by zero Without loss of generality assume that f(u) = Then l + l + 1 = 5t + 6 Hence l = 5t+5 This implies t 1 (mod ) Suppose f(v) = f(x) = f(y) = then r + r + = 5t + 5 and hence r = 5t+1 But l + r > t +, a contradiction If f(v) = f(x) = f(y) = 1 then r+ r = 5t+5 Thereforer = 5t+5 Here alsol+r > t+, a contradiction Forf(v) = and f(x) = f(y)=1 we haver+ r+ 1 = 5t+5 Then r = 5t+, a contradiction tot 1(mod ) Assume f(v) = f(y) = and f(x) = 1 In this case r + r + = 5t + 5 Hence r = 5t+ This is impossible since t 1 (mod ) Consider the case f(v) = 1 and f(x) = f(y) = Here r + r + = 5t+ Then r = 5t+ Here also a contradiction to the values of t When f(v) = f(x) = 1 and f(y) =, we have r + r + = 5t + 5 and hence r = 5t+ But l+r > t+, a contradiction References [1] J A Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16 (1) # Ds6 [] F Harary, Graph theory, Addision wesley, New Delhi (1969) [] R Ponraj, A M S Ramasamy and S Sathish Narayanan, Total Mean Cordial labeling of graphs, International JMath Combin, (1) Author information R Ponraj and S Sathish Narayanan, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi- 67 1, India ÔÓÒÖ Ñ Ø Ñ ÐºÓÑ Ø ÖÚ Ñ ÐºÓÑ Ê Ú ÔØ ÂÙÒ ½ ½¼½ º ÇØÓ Ö ¾ ¾¼½ º
Difference Cordial Labeling of Graphs Obtained from Double Snakes
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 3 (013), pp. 317-3 International Research Publication House http://www.irphouse.com Difference Cordial Labeling of Graphs
More informationk-difference cordial labeling of graphs
International J.Math. Combin. Vol.(016), 11-11 k-difference cordial labeling of graphs R.Ponraj 1, M.Maria Adaickalam and R.Kala 1.Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-6741,
More informationOdd-even sum labeling of some graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (017), 57-63. ISSN Print : 49-338 Odd-even sum labeling of some graphs ISSN Online : 319-515 K. Monika 1, K. Murugan 1 Department of
More informationSQUARE DIFFERENCE 3-EQUITABLE LABELING FOR SOME GRAPHS. Sattur , TN, India. Sattur , TN, India.
International Journal of Science, Engineering Technology Research (IJSETR), Volume 5, Issue, March 2016 SQUARE DIFFERENCE -EQUITABLE LABELING FOR SOME GRAPHS R Loheswari 1 S Saravana kumar 2 1 Research
More informationSOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS. Sattur , TN, India.
SOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS A.Raja Rajeswari 1 and S.Saravana Kumar 1 Research Scholar, Department of Mathematics, Sri S.R.N.M.College, Sattur-66 03, TN, India. Department
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationSum divisor cordial labeling for star and ladder related graphs
Proyecciones Journal of Mathematics Vol. 35, N o 4, pp. 437-455, December 016. Universidad Católica del Norte Antofagasta - Chile Sum divisor cordial labeling for star and ladder related graphs A. Lourdusamy
More informationOn Odd Sum Graphs. S.Arockiaraj. Department of Mathematics. Mepco Schlenk Engineering College, Sivakasi , Tamilnadu, India. P.
International J.Math. Combin. Vol.4(0), -8 On Odd Sum Graphs S.Arockiaraj Department of Mathematics Mepco Schlenk Engineering College, Sivakasi - 66 00, Tamilnadu, India P.Mahalakshmi Department of Mathematics
More informationSkolem Difference Mean Graphs
royecciones Journal of Mathematics Vol. 34, N o 3, pp. 43-54, September 015. Universidad Católica del Norte Antofagasta - Chile Skolem Difference Mean Graphs M. Selvi D. Ramya Dr. Sivanthi Aditanar College
More informationSUPER MEAN NUMBER OF A GRAPH
Kragujevac Journal of Mathematics Volume Number (0), Pages 9 0. SUPER MEAN NUMBER OF A GRAPH A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ Abstract. Let G be a graph and let f : V (G) {,,..., n} be a function
More informationFurther Results on Square Sum Graph
International Mathematical Forum, Vol. 8, 2013, no. 1, 47-57 Further Results on Square Sum Graph K. A. Germina School of Mathematical and Physical Sciences Central University of Kerala, Kasaragode, India
More informationk-remainder Cordial Graphs
Journal of Algorihms and Compuaion journal homepage: hp://jac.u.ac.ir k-remainder Cordial Graphs R. Ponraj 1, K. Annahurai and R. Kala 3 1 Deparmen of Mahemaics, Sri Paramakalyani College, Alwarkurichi
More informationROOT SQUARE MEAN GRAPHS OF ORDER 5
Available online at http://scik.org J. Math. Comput. Sci. 5 (2015), No. 5, 708-715 ISSN: 1927-5307 ROOT SQUARE MEAN GRAPHS OF ORDER 5 S.S. SANDHYA 1 S. SOMASUNDARAM 2 AND S. ANUSA 3,* 1 Department of Mathematics,
More informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
More informationHarmonic Mean Labeling for Some Special Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 1 (2013), pp. 55-64 International Research Publication House http://www.irphouse.com Harmonic Mean Labeling for Some Special
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationSuper Mean Labeling of Some Classes of Graphs
International J.Math. Combin. Vol.1(01), 83-91 Super Mean Labeling of Some Classes of Graphs P.Jeyanthi Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur-68 15, Tamil Nadu,
More informationGraceful Labeling of Some Theta Related Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 78-84 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 11 September 2013 www.researchmathsci.org International Journal of Graceful Labeling of Some
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationOdd Sum Labeling of Tree Related Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 4 (016), 11 16. ISSN: 347-1557 Available Online: http://ijmaa.in/ International Journal 347-1557 of Mathematics Applications And
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationPower Mean Labeling of some Standard Graphs
Power Mean Labeling of some Standard Graphs P. Mercy & S. Somasundaram Department of Mathematics Manomaniam Sundaranar University Tirunelveli-62702 Abstarct: A graph G = (V, E) is called a Power mean graph
More informationOne Modulo Three Harmonic Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 4 (20), pp. 4-422 International Research Publication House http://www.irphouse.com One Modulo Three Harmonic Mean Labeling
More informationMean Cordial Labeling of Tadpole and Olive Tree
Annals of Pure and Applied Mathematics Vol. 11, No. 2, 216, 19-116 ISSN: 2279-87X (P), 2279-888(online) Published on 8 June 216 www.researchmathsci.org Annals of Mean Cordial Labeling of Tadpole and Olive
More informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
More informationFurther results on relaxed mean labeling
Int. J. Adv. Appl. Math. and Mech. 3(3) (016) 9 99 (ISSN: 347-59) Journal homepage: www.ijaamm.com IJAAMM International Journal of Advances in Applied Mathematics and Mechanics Further results on relaxed
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationSuper Root Square Mean Labeling Of Disconnected Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 1 C (2016), 93 98. ISSN: 2347-1557 Available Online: http://ijmaa.in/ International Journal 2347-1557 of Mathematics Applications
More informationAvailable Online through
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com 0-EDGE MAGIC LABELING OF SHADOW GRAPH J.Jayapriya*, Department of Mathematics, Sathyabama University, Chennai-119,
More informationOn Graceful Labeling of Some Bicyclic Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 3, 2013, 1-8 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 4 October 2013 www.researchmathsci.org International Journal of On Graceful Labeling of Some
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationIntegral Root Labeling of Graphs 1 V.L. Stella Arputha Mary & 2 N. Nanthini
International Journal of Mathematics Trends and Technology (IJMTT) Volume Number - February 08 Integral Root Labeling of Graphs V.L. Stella Arputha Mary & N. Nanthini Department of Mathematics, St. Mary
More informationRoot Square Mean Labeling of Some More. Disconnected Graphs
International Mathematical Forum, Vol. 10, 2015, no. 1, 25-34 HIKARI Ltd,www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.411196 Root Square Mean Labeling of Some More Disconnected Graphs S. S. Sandhya
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationSome Results on Super Mean Graphs
International J.Math. Combin. Vol.3 (009), 8-96 Some Results on Super Mean Graphs R. Vasuki 1 and A. Nagarajan 1 Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur - 68
More informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationResearch Article Some New Results on Prime Cordial Labeling
ISRN Combinatorics Volume 014, Article ID 07018, 9 pages http://dx.doi.org/10.1155/014/07018 Research Article Some New Results on Prime Cordial Labeling S. K. Vaidya 1 andn.h.shah 1 Saurashtra University,
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationCombinatorial Labelings Of Graphs
Applied Mathematics E-Notes, 6(006), 51-58 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Combinatorial Labelings Of Graphs Suresh Manjanath Hegde, Sudhakar Shetty
More informationSome New Results on Super Stolarsky-3 Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 10, Number 1 (2018), pp. 7-20 International Research Publication House http://www.irphouse.com Some New Results on Super Stolarsky-3
More informationRadio Number of Cube of a Path
International J.Math. Combin. Vol. (00), 05-9 Radio Number of Cube of a Path B. Sooryanarayana, Vishu Kumar M. and Manjula K.. Dept.of Mathematical & Computational Studies, Dr.Ambedkar Institute of Technology,
More informationL(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs
MATEMATIKA, 2014, Volume 30, Number 2, 109-116 c UTM Centre for Industrial and Applied Mathematics L(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs Murugan Muthali Tamil Nadu Open University
More informationSUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS
SUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS 1 S.S.Sandhya S.Somasundaram and 3 S.Anusa 1.Department of Mathematics,Sree Ayyappa College for women,chunkankadai:69003,.department of Mathematics, Manonmaniam
More informationThe Exquisite Integer Additive Set-Labeling of Graphs
The Exquisite Integer Additive Set-Labeling of Graphs N. K. Sudev 1, K. A. Germina 2 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501, Kerala, India.
More informationChapter V DIVISOR GRAPHS
i J ' Chapter V DIVISOR GRAPHS Divisor graphs 173 CHAPTER V DIVISOR GRAPHS 5.1 Introduction In this chapter we introduce the concept of a divisor graph. Adivisor graph 0(8) of a finite subset S of Zis
More informationOn Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs
Australian Journal of Basic and Applied Sciences, 5(9): 2042-2052, 2011 ISSN 1991-8178 On Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs 1 Gee-Choon Lau, 2 Sin-Min Lee, 3
More informationTopological Integer Additive Set-Graceful Graphs
Topological Integer Additive Set-Graceful Graphs N. K.Sudev arxiv:1506.01240v1 [math.gm] 3 Jun 2015 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501,
More informationSuper Fibonacci Graceful Labeling of Some Special Class of Graphs
International J.Math. Combin. Vol.1 (2011), 59-72 Super Fibonacci Graceful Labeling of Some Special Class of Graphs R.Sridevi 1, S.Navaneethakrishnan 2 and K.Nagarajan 1 1. Department of Mathematics, Sri
More informationPower Mean Labeling of Identification Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 6, Issue, 208, PP -6 ISSN 2347-307X (Print) & ISSN 2347-342 (Online) DOI: http://dx.doi.org/0.2043/2347-342.06000
More informationMagic Graphoidal on Class of Trees A. Nellai Murugan
Bulletin of Mathematical Sciences and Applications Online: 2014-08-04 ISSN: 2278-9634, Vol. 9, pp 33-44 doi:10.18052/www.scipress.com/bmsa.9.33 2014 SciPress Ltd., Switzerland Magic Graphoidal on Class
More informationSuper Fibonacci Graceful Labeling
International J.Math. Combin. Vol. (010), -40 Super Fibonacci Graceful Labeling R. Sridevi 1, S.Navaneethakrishnan and K.Nagarajan 1 1. Department of Mathematics, Sri S.R.N.M.College, Sattur - 66 0, Tamil
More informationON ANNIHILATOR GRAPHS OF NEAR-RINGS
Palestine Journal of Mathematics Vol. 5(Special Issue: 1) (2016), 100 107 Palestine Polytechnic University-PPU 2016 ON ANNIHILATOR GRAPHS OF NEAR-RINGS T. Tamizh Chelvam and S. Rammurthy Communicated by
More informationODD HARMONIOUS LABELING OF PLUS GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 303-4874, ISSN (o) 303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 515-56 DOI: 10.751/BIMVI1703515J Former BULLETIN OF THE
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationLucky Edge Labeling of P n, C n and Corona of P n, C n
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume, Issue 8, August 0, PP 70-78 ISSN 7-07X (Print) & ISSN 7- (Online) www.arcjournals.org Lucky Edge Labeling of P
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationQ(a)- Balance Edge Magic of Sun family Graphs
Volume-6, Issue-3, May-June 2016 International Journal of Engineering and Management Research Page Number: 143-149 Q(a)- Balance Edge Magic of Sun family Graphs S.Vimala 1, R.Prabavathi 2 1 Assistant Professor,
More informationInternational Journal of Scientific Research and Reviews
Research article Available online www.ijsrr.org ISSN: 2279 0543 International Journal of Scientific Research and Reviews Fibonacci Prime Labeling of Udukkai and Octopus Graphs Chandrakala S. *1 and Sekar
More informationOn (Super) Edge-Magic Total Labeling of Subdivision of K 1,3
SUT Journal of Mathematics Vol. 43, No. (007), 17 136 On (Super) Edge-Magic Total Labeling of Subdivision of K 1,3 Anak Agung Gede Ngurah, Rinovia Simanjuntak and Edy Tri Baskoro (Received August 31, 006)
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev arxiv:1504.07132v1 [math.gm] 23 Apr 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationPERMUTABILITY GRAPH OF CYCLIC SUBGROUPS
Palestine Journal of Mathematics Vol. 5(2) (2016), 228 239 Palestine Polytechnic University-PPU 2016 PERMUTABILITY GRAPH OF CYCLIC SUBGROUPS R. Rajkumar and P. Devi Communicated by Ayman Badawi MSC 2010
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More information\\f(x+y)-f(x)-f(y)\\<8. f(x+y)=f(x)+f(y).
proceedings of the american mathematical society Volume 74, Number 2, May 1979 THE STABILITY OF THE EQUATION/(x + y) = f(x)f(y) JOHN BAKER1, J. LAWRENCE2 AND F. ZORZITTO3 ABSTRACT.lt is proved that if
More informationOn the Ramsey number of 4-cycle versus wheel
Indonesian Journal of Combinatorics 1 (1) (2016), 9 21 On the Ramsey number of 4-cycle versus wheel Enik Noviani, Edy Tri Baskoro Combinatorial Mathematics Research Group Faculty of Mathematics and Natural
More informationMalaya J. Mat. 2(3)(2014)
Malaya J Mat (3)(04) 80-87 On k-step Hamiltonian Bipartite and Tripartite Graphs Gee-Choon Lau a,, Sin-Min Lee b, Karl Schaffer c and Siu-Ming Tong d a Faculty of Comp & Mathematical Sciences, Universiti
More informationThe L(3, 2, 1)-labeling on the Skew and Converse Skew Products of Graphs
Advances in Theoretical and Applied Mathematics. ISSN 0973-4554 Volume 11, Number 1 (2016), pp. 29 36 Research India Publications http://www.ripublication.com/atam.htm The L(3, 2, 1)-labeling on the Skew
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationGraphic sequences, adjacency matrix
Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:
More informationThe (mod, integral and exclusive) sum number of
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 1 (2016), pp. 297-307 Research India Publications http://www.ripublication.com The (mod, integral and exclusive) sum number
More informationEdge Fixed Steiner Number of a Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 16, 771-785 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7694 Edge Fixed Steiner Number of a Graph M. Perumalsamy 1,
More informationUniversity of Warwick institutional repository:
University of Warwick institutional repository: http://go.warwick.ac.uk/wrap This paper is made available online in accordance with publisher policies. Please scroll down to view the document itself. Please
More informationPrime Cordial Labeling For Some Cycle Related Graphs
Int. J. Open Probles Copt. Math., Vol. 3, No. 5, Deceber 010 ISSN 1998-66; Copyright c ICSRS Publication, 010 www.i-csrs.org Prie Cordial Labeling For Soe Cycle Related Graphs S K Vaidya 1 and P L Vihol
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationOn the crosscap of the annihilating-ideal graph of a commutative ring
Palestine Journal of Mathematics Vol. 7()(08), 5 60 Palestine Polytechnic University-PPU 08 On the crosscap of the annihilating-ideal graph of a commutative ring K. Selvakumar and P. Subbulakshmi Communicated
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationDistance Connectivity in Graphs and Digraphs
Distance Connectivity in Graphs and Digraphs M.C. Balbuena, A. Carmona Departament de Matemàtica Aplicada III M.A. Fiol Departament de Matemàtica Aplicada i Telemàtica Universitat Politècnica de Catalunya,
More informationOriented vertex and arc colorings of outerplanar graphs
Information Processing Letters 100 (2006) 97 104 www.elsevier.com/locate/ipl Oriented vertex and arc colorings of outerplanar graphs Alexandre Pinlou,1, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours
More information2 β 0 -excellent graphs
β 0 -excellent graphs A. P. Pushpalatha, G. Jothilakshmi Thiagarajar College of Engineering Madurai - 65 015 India Email: gjlmat@tce.edu, appmat@tce.edu S. Suganthi, V. Swaminathan Ramanujan Research Centre
More informationOn the Gracefulness of Cycle related graphs
Volume 117 No. 15 017, 589-598 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu On the Gracefulness of Cycle related graphs S.Venkatesh 1 and S. Sivagurunathan
More informationEquivalence Resolving Partition of a Graph
Volume 03 - Issue 06 June 2018 PP. 49-54 Equivalence Resolving Partition of a Graph S. Hemalathaa 1, A. Subramanian 2, P. Aristotle 3, V.Swamianathan 4 1 (Reg. No 10445,Department of Mathematics, The M.D.T.
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501, India. K. A. Germina PG & Research
More informationDepartment of Mathematics, Sri Krishna Institute of Technology, Bengaluru , Karnataka, India. *Correspondence author s
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 6393-6406 Research India Publications http://www.ripublication.com ON SUPER (a, d)-anti-edgemagic OF C m ok
More informationFlow Network. The following figure shows an example of a flow network:
Maximum Flow 1 Flow Network The following figure shows an example of a flow network: 16 V 1 12 V 3 20 s 10 4 9 7 t 13 4 V 2 V 4 14 A flow network G = (V,E) is a directed graph. Each edge (u, v) E has a
More informationOn Submodular and Supermodular Functions on Lattices and Related Structures
On Submodular and Supermodular Functions on Lattices and Related Structures Dan A. Simovici University of Massachusetts Boston Department of Computer Science Boston, USA dsim@cs.umb.edu Abstract We give
More informationON SUPER HERONIAN MEAN LABELING OF GRAPHS
ON SUPER HERONIAN MEAN LABELING OF GRAPHS S.S.Sandhya Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai- 00,Tamilnadu,India. E.Ebin Raja Merly Department of Mathematics, Nesamony
More informationJuan Juan Salon. EH National Bank. Sandwich Shop Nail Design. OSKA Beverly. Chase Bank. Marina Rinaldi. Orogold. Mariposa.
( ) X é X é Q Ó / 8 ( ) Q / ( ) ( ) : ( ) : 44-3-8999 433 4 z 78-19 941, #115 Z 385-194 77-51 76-51 74-7777, 75-5 47-55 74-8141 74-5115 78-3344 73-3 14 81-4 86-784 78-33 551-888 j 48-4 61-35 z/ zz / 138
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
More informationA Quadratic Integer Programming with Application in Chaotic Mappings of Complete Multipartite Graphs. Technical Report
A Quadratic Integer Programming with Application in Chaotic Mappings of Complete Multipartite Graphs Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS Building
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationON THE METRIC DIMENSION OF CIRCULANT GRAPHS WITH 4 GENERATORS
Volume 12, Number 2, Pages 104 114 ISSN 1715-0868 ON THE METRIC DIMENSION OF CIRCULANT GRAPHS WITH 4 GENERATORS TOMÁŠ VETRÍK Abstract. Circulant graphs are Cayley graphs of cyclic groups and the metric
More informationDistance Two Labeling of Some Total Graphs
Gen. Math. Notes, Vol. 3, No. 1, March 2011, pp.100-107 ISSN 2219-7184; Copyright c ICSRS Publication, 2011 www.i-csrs.org Available free online at http://www.geman.in Distance Two Labeling of Some Total
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationUniversity of Alabama in Huntsville Huntsville, AL 35899, USA
EFFICIENT (j, k)-domination Robert R. Rubalcaba and Peter J. Slater,2 Department of Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899, USA e-mail: r.rubalcaba@gmail.com 2 Department
More information