Sum divisor cordial labeling for star and ladder related graphs
|
|
- Sherman Fitzgerald
- 5 years ago
- Views:
Transcription
1 Proyecciones Journal of Mathematics Vol. 35, N o 4, pp , December 016. Universidad Católica del Norte Antofagasta - Chile Sum divisor cordial labeling for star and ladder related graphs A. Lourdusamy St. Xavier s College (autonomous), India and F. Patrick St. Xavier s College (autonomous), India Received : April 016. Accepted : October 016 Abstract A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,,, V (G) } such that an edge uv is assigned the label 1 if divides f(u) +f(v) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that D (K 1,n ), S 0 (K 1,n ), D (B n,n ), DS(B n,n ), S 0 (B n,n ), S(B n,n ), <K (1) 1,n K() 1,n >, S(L n ), L n K 1, SL n, TL n, TL n K 1 and CH n are sum divisor cordial graphs. AMS Subject Classification 010 : 05C78. Keywords : Divisor cordial, sum divisor cordial.
2 438 A. Lourdusamy and Jyotindra C. Prajapati 1. Introduction All graphs considered here are simple, finite, connected and undirected. For all other standard terminology and notations we follow Harary []. A labeling of a graph is a map that carries the graph elements to the set of numbers, usually to the set of non-negative or positive integers. If the domain is the set of vertices the labeling is called vertex labeling. If the domain is the set of edges then the labeling is called edge labeling. If the labels are assigned to both vertices and edges then the labeling is called total labeling. For all detailed survey of graph labeling we refer Gallian [1]. A. Lourdusamy and F. Patrick introduced the concept of sum divisor cordial labeling in [3]. In [3, 4], sum divisor cordial labeling behaviour of several graphs like path, complete bipartite graph, bistar and some standard graphs have been investigated. In this paper, we investigate the sum divisor cordial labeling behavior of D (K 1,n ), S 0 (K 1,n ), D (B n,n ), DS(B n,n ), S 0 (B n,n ), S(B n,n ), <K (1) 1,n K() 1,n >, S(L n), L n K 1, SL n, TL n, TL n K 1 and CH n. Definition 1.1. Let G =(V (G),E(G)) be a simple graph and f : V (G) {1,,, V (G) } be a bijection. For each edge uv, assign the label 1 if (f(u)+f(v)) and the label 0 otherwise. The function f is called a sum divisor cordial labeling if e f (0) e f (1) 1. A graph which admits a sum divisor cordial labeling is called a sum divisor cordial graph. Definition 1.. [9] For every vertex v V (G), the open neighbourhood set N(v) is the set of all vertices adjacent to v in G. Definition 1.3. [8] For a graph G the splitting graph S 0 (G) of a graph G is obtained by adding a new vertex v 0 corresponding to each vertex v of G such that N(v) =N(v 0 ). Definition 1.4. [8] The shadow graph D (G) of a connected graph G is obtained by taking two copies of G, sayg 0 and G 00. Join each vertex u 0 in G 0 to the neighbours of corresponding vertex u 00 in G 00. Definition 1.5. [8] Duplication of a vertex v k by a new edge e = v 0 k v00 k in agraphg produces a new graph G 0 such that N(v 0 k ) N(v00 k )=v k. Definition 1.6. [8] Let G be the a graph with V = S 1 S S 3 S i T where each S i is a set of vertices having at least two vertices of the same degree and T = V (G) \ t i=1 S i. The degree splitting graph of G denoted by DS(G) is obtained from G by adding vertices w 1,w,...,w t and joining to each vertex of S i for 1 i t.
3 Sum divisor cordial labeling for star and ladder related graphs 439 Definition 1.7. [6] The subdivision graph S(G) is obtained from G by subdividing each edge of G with a vertex. Definition 1.8. [7] Consider two copies of graph G(wheel, star, fan and friendship) namely G 1 and G. Then the graph G 0 =<G 1 G > is the graph obtained by joining the apex vertices of G 1 and G by an edge as well as to a new vertex v 0. Definition 1.9. [6] The slanting ladder SL n is a graph obtained from two paths u 1,u,,u n and v 1,v,,v n by joining each u i with v i+1 for (1 i n 1). Definition [5] The triangular ladder TL n is a graph obtained from L n by adding the edges u i v i+1, 1 i n 1, whereu i and v i, 1 i nare the vertices of L n such that u 1,u,,u n and v 1,v,,v n are two paths of length n in the graph L n. Definition [6] The corona G 1 G of two graphs G 1 (p 1,q 1 ) and G (p,q ) is defined as the graph obtained by taking one copy of G 1 and p 1 copies of G and joining the i th vertex of G 1 with an edge to every vertex in the i th copy of G. Definition 1.1. [7] The closed helm CH n is the graph obtained from helm H n by joining each pendant vertex to form a cycle.. Main results Theorem.1. The graph S 0 (K 1,n ) is sum divisor cordial graph. Proof. Let v 1,v,,v n be the pendant vertices and v be the apex vertex of K 1,n and u, u 1,u,,u n are added vertices corresponding to v, v 1,v,,v n to obtain S 0 (K 1,n ). Let G = S 0 (K 1,n ). Then, G is of order n +andsize3n. Define f : V (G) {1,,, n +} as follows: i +ifi is even i +1ifi is even f(u) =1; f(v) =; f(v i )={ i +1ifi is odd f(u i )={ i +ifi is odd
4 440 A. Lourdusamy and Jyotindra C. Prajapati f (vu i )={ 1 if i is odd 0if i is even f (vv i )={ 0 if i is odd 1if i is even f (uv i )={ 1 if i is odd 0if i is even j k We observe that, e f (0) = 3n and e f (1) = Thus, e f (1) e f (0) 1. Hence, S 0 (K 1,n ) is sum divisor cordial graph. l 3n m. Example.. A sum divisor cordial labeling of S 0 (K 1,5 ) isshowninfigure.1 Theorem.3. The graph D (K 1,n ) is sum divisor cordial graph. Proof. Let u, u 1,u,,u n and v, v 1,v,,v n be the vertices of two copies of K 1,n.LetG = D (K 1,n ). Then V (G) ={u, v, u 1,u,,u n,v 1,v,,v n } and E(G) ={uu i,vv i,uv i,vu i : 1 i n}. Also, G is of order n + and size 4n. Define f : V (G) {1,,, n +} as follows: f(u) =1; f(v) =;
5 Sum divisor cordial labeling for star and ladder related graphs 441 f(u i )={ i +1ifi is odd i +ifi is even f(v i )={ i +ifi is odd i +1ifi is even f (uu i )={ 1 if i is odd 0if i is even f (vu i )={ 0 if i is odd 1if i is even f (vv i )={ 1 if i is odd 0if i is even f (uv i )={ 0 if i is odd 1if i is even We observe that, e f (0) = n and e f (1) = n. Thus, e f (1) e f (0) 1. Hence, D (K 1,n ) is sum divisor cordial graph. Example.4. A sum divisor cordial labeling of D (K 1,4 ) isshowninfigure. Theorem.5. The graph S 0 (B n,n ) is sum divisor cordial graph.
6 44 A. Lourdusamy and Jyotindra C. Prajapati Proof. Let u, v, u 1,u,,u n,v 1,v,,v n be the vertices of B n,n. Let u 0,v 0,u 0 i,v0 i are added vertices corresponding to u, v, u i,v i to obtain S 0 (B n,n ). Let G = S 0 (B n,n ) Then, G is of order 4n +4 and size 6n +3. Define f : V (G) {1,,, 4n +4} as follows: f(u) =1; f(v) =3; f(u 0 )=; f(v 0 )=4; f(u i )=4i +;1 i n f(u 0 i )=4i +1;1 i n f(v i )=4i +3;1 i n f(v 0 i )=4i +4;1 i n f (uv) =1; f (uv 0 )=0; f (vu 0 )=0; f (u 0 u i )=1;1 i n f (uu i )=0;1 i n f (uu 0 i )=1;1 i n f (v 0 v i )=0;1 i n f (vv i )=1;1 i n f (vv 0 i )=0;1 i n We observe that, e f (0) = 3n +ande f (1) = 3n +1. Thus, e f (1) e f (0) 1. Hence, S 0 (B n,n ) is sum divisor cordial graph. Example.6. A sum divisor cordial labeling of S 0 (B 5,5 ) isshowninfigure.3
7 Sum divisor cordial labeling for star and ladder related graphs 443 Theorem.7. The graph D (B n,n ) is sum divisor cordial graph. Proof. Let u, v, u 1,u,,u n,v 1,v,,v n be the vertices of B n,n.let G = D (B n,n ). Then V (G) ={u, v, u 0,v 0 } S {u i,v i,u 0 i,v0 i :1 i n} and E(G) ={uv, u 0 v, uv 0,u 0 v 0 } S {uu i,uu 0 i,u0 u i,u 0 u 0 i,vv i,vv 0 i,v0 v i,v 0 v 0 i :1 i n}. Also, G is of order 4n +4 and size 8n +4. Define f : V (G) {1,,, 4n +4} as follows: f(u) =1; f(v) =3; f(u 0 )=; f(v 0 )=4; f(u i )=4i +1;1 i n f(u 0 i )=4i +;1 i n f(v i )=4i +4;1 i n f(v 0 i )=4i +3;1 i n f (uv) =1; f (uv 0 )=0; f (vu 0 )=0; f (v 0 u 0 )=1; f (uu i )=1;1 i n f (u 0 u i )=0;1 i n f (u 0 u 0 i )=1;1 i n
8 444 A. Lourdusamy and Jyotindra C. Prajapati f (uu 0 i )=0;1 i n f (vv i )=0;1 i n f (v 0 v i )=1;1 i n f (v 0 v 0 i )=0;1 i n f (vv 0 i )=1;1 i n We observe that, e f (0) = 4n +ande f (1) = 4n +. Thus, e f (1) e f (0) 1. Hence, D (B n,n ) is sum divisor cordial graph. Example.8. A sum divisor cordial labeling of D (B 4,4 ) isshowninfigure.4 Theorem.9. The graph DS(B n,n ) is sum divisor cordial graph. Proof. Let G = DS(B n,n ). Let V (G) ={u, v, w 1,w } S {u i,v i :1 i n} and E(G) ={uv, uw,vw } S {uu i,vv i,u i w 1,v i w 1 :1 i n}.then, G is of order n +4andsize4n +3. Define f : V (G) {1,,, n +4} as follows: f(u) =4; f(v) =; f(w 1 )=1; f(w )=3; f(u i )=i +4;1 i n f(v i )=i +3;1 i n
9 Sum divisor cordial labeling for star and ladder related graphs 445 f (uv) =1; f (uw )=0; f (vw )=0; f (uu i )=1;1 i n f (u i w 1 )=0;1 i n f (vv i )=0;1 i n f (v i w 1 )=1;1 i n We observe that, e f (0) = n +ande f (1) = n +1. Thus, e f (1) e f (0) 1. Hence, DS(B n,n ) is sum divisor cordial graph. Example.10. A sum divisor cordial labeling of DS(B 3,3 ) is shown in Figure.5 Theorem.11. The graph S(B n,n ) is sum divisor cordial graph. Proof. Let G = S(B n,n ). Let V (G) ={u, v, w} S {u i,v i,u 0 i,v0 i :1 i n} and E(G) ={uw, wv} S {uu 0 i,u0 i u i,vv 0 i,v0 i v i :1 i n}. Then, G is of order 4n +3and size 4n +. Define f : V (G) {1,,, 4n +3} as follows: f(u) =1; f(v) =; f(w) =3; f(u i )=4i;1 i n f(u 0 i )=4i +1;1 i n
10 446 A. Lourdusamy and Jyotindra C. Prajapati f(v i )=4i +3;1 i n f(v 0 i )=4i +;1 i n f (uw) =1; f (wv) =0; f (uu 0 i )=1;1 i n f (u 0 i u i)=0;1 i n f (vv 0 i )=1;1 i n f (v 0 i v i)=0;1 i n We observe that, e f (0) = n +1ande f (1) = n +1. Thus, e f (1) e f (0) 1. Hence, S(B n,n ) is sum divisor cordial graph. Example.1. A sum divisor cordial labeling of S(B 3,3 ) isshowninfigure.6 Theorem.13. The graph <K (1) 1,n K() 1,n > is sum divisor cordial graph. Proof. Let v (1) 1,v(1),,v(1) n be the pendant vertices of K (1) 1,n and v () 1,v(),,v() n be the pendant vertices of K () 1,n apex vertices of K (1) 1,n and K() 1,n common vertex x. Let G =< K (1). Let u and v be the respectively and u, v areadjacenttoanew 1,n K() 1,n >. Then, G is of order n +3 and size n +3. Define f : V (G) {1,,, n +3} as follows: f(x) =;
11 Sum divisor cordial labeling for star and ladder related graphs 447 f(u) =1; f(v) =3; f(u i 1 )=4i;1 i n f(u i )=4i +3;1 i n f(v i 1 )=4i +1;1 i n f(v i )=4i +;1 i n f (ux) =0; f (vx) =0; f (uv) =1; f (uu i 1 )=0;1 i n f (uu i )=1;1 i n f (vv i 1 )=1;1 i n f (vv i )=0;1 i n We observe that, e f (0) = n +ande f (1) = n +1. Thus, e f (1) e f (0) 1. Hence, <K (1) 1,n K() 1,n > is sum divisor cordial graph. Example.14. A sum divisor cordial labeling of <K (1) in Figure.7 1,5 K() 1,5 > is shown Theorem.15. The graph L n K 1 is sum divisor cordial graph. Proof. Let u 1,u,,u n and v 1,v,,v n be the vertices of L n.letx i be the vertex which is attached to u i and y i be the vertex which is attached
12 448 A. Lourdusamy and Jyotindra C. Prajapati to v i. Let G = L n K 1. Then, G is of order 4n and size 5n. Define f : V (G) {1,,, 4n} as follows: f(u i 1 )=8i 5; 1 i n f(u i )=8i 3; 1 i n f(x i 1 )=8i 7; 1 i n f(x i )=8i ; 1 i n f(v i 1 )=8i 6; 1 i n f(v i )=8i 1; 1 i n f(y i 1 )=8i 4; 1 i n f(y i )=8i;1 i n f (u i 1 x i 1 )=1;1 i n f (u i x i )=0;1 i n f (u i u i+1 )=1;1 i n 1 f (v i v i+1 )=0;1 i n 1 f (u i 1 v i 1 )=0;1 i n f (u i v i )=1;1 i n f (v i 1 y i 1 )=1;1 i n f (v i y i )=0;1 i n k l m We observe that, e f (0) = and e f (1) = 5n. j 5n Thus, e f (1) e f (0) 1. Hence, L n K 1 is sum divisor cordial graph. Example.16. A sum divisor cordial labeling of L 6 K 1 is shown in Figure.8
13 Sum divisor cordial labeling for star and ladder related graphs 449 Theorem.17. The graph S(L n ) is sum divisor cordial graph. Proof. Let u 1,u,,u n and v 1,v,,v n be the vertices of L n.letv 0 i be the newly added vertex between v i and v i+1.letu 0 i be the newly added vertex between u i and u i+1.letw i be the newly added vertex between v i and u i.letg = S(L n ). Then, G is of order 5n andsize6n 4. Define f : V (G) {1,,, 5n } as follows: f(v 1 )=1; f(v i+1 )=5i;1 i n 1 f(u 1 )=; f(u i+1 )=5i +3;1 i n 1 f(w 1 )=3; f(w i+1 )=5i +;1 i n 1 f(v 0 i )=5i 1; 1 i n 1 f(u 0 i )=5i +1;1 i n 1 f (v 1 v 0 1 )=0; f (v i v 0 i )=1; i n 1 f (v 0 i v i+1) =0;1 i n 1 f (u 1 u 0 1 )=1; f (u i u 0 i )=0; i n 1 f (u 0 i u i+1) =1;1 i n 1 f (v i w i )=1;1 i n
14 450 A. Lourdusamy and Jyotindra C. Prajapati f (u i w i )=0;1 i n We observe that, e f (0) = 3n ande f (1) = 3n. Thus, e f (1) e f (0) 1. Hence, S(L n ) is sum divisor cordial graph. Example.18. A sum divisor cordial labeling of S(L 5 ) isshowninfigure.9 Theorem.19. The slanting ladder SL n is sum divisor cordial graph. Proof. Let G = SL n. Let V (G) ={u i,v i :1 i n} and E(G) = {v i v i+1,u i u i+1,u i v i+1 :1 i n 1}. Then, G is of order n and size 3n 3. Define f : V (G) {1,,, n} as follows: f(u i )={ iif i 1, 0(mod 4) i 1if i, 3(mod 4) f(v i )={ i 1if i 1, 0(mod 4) iif i, 3(mod 4) f (u i u i+1 )={ 0 if i is odd 1if i is even f (v i v i+1 )={ 0 if i is odd 1if i is even f (u i v i+1 )={ 1 if i is odd 0if i is even We observe that, e f (0) = l m 3n 3 and e f (1) = j k 3n 3.
15 Sum divisor cordial labeling for star and ladder related graphs 451 Thus, e f (0) e f (1) 1. Hence, SL n is sum divisor cordial graph. Example.0. A sum divisor cordial labeling of SL 5 is shown in Figure.10 Theorem.1. The triangular ladder TL n is sum divisor cordial graph. Proof. Let G = TL n. Let V (G) ={u i,v i :1 i n} and E(G) = {u i u i+1,v i v i+1,u i v i+1 :1 i n 1} S {u i v i :1 i n}. Then, G is of order n and size 4n 3. Define f : V (G) {1,,, n} as follows: f(u i )=i 1; 1 i n f(v i )=i;1 i n f (u i u i+1 )=1;1 i n 1 f (u i v i )=0;1 i n f (v i v i+1 )=1;1 i n 1 f (u i v i+1 )=0;1 i n 1 We observe that, e f (0) = n 1ande f (1) = n. Thus, e f (0) e f (1) 1. Hence, TL n is sum divisor cordial graph. Example.. A sum divisor cordial labeling of TL 5 is shown in Figure.11
16 45 A. Lourdusamy and Jyotindra C. Prajapati Theorem.3. The graph TL n K 1 is sum divisor cordial graph. Proof. Let u 1,u,,u n and v 1,v,,v n be the vertices of TL n.let G = TL n K 1. Then V (G) ={u i,v i,x i,y i :1 i n} and E(G) = {u i u i+1,v i v i+1,u i v i+1 :1 i n 1} S {u i x i,v i y i,u i v i :1 i n}. Then, G is of order 4n and size 6n 3. Define f : V (G) {1,,, 4n} as follows: f(u i )={ 4 i 1if i is odd 4i 3if i is even f(x i )={ 4 i 3if i is odd 4i if i is even f(v i )={ 4 i if i is odd 4i 1if i is even f(y i )=4i;1 i n f (u i x i )={ 1 if i is odd 0if i is even f (v i y i )={ 1 if i is odd 0if i is even f (u i v i )={ 0 if i is odd 1if i is even f (u i v i+1 )={ 1 if i is odd 0if i is even
17 Sum divisor cordial labeling for star and ladder related graphs 453 f (u i u i+1 )=1;1 i n 1 f (v i v i+1 )=0;1 i n 1 We observe that, e f (0) = 3n ande f (1) = 3n 1. Thus, e f (1) e f (0) 1. Hence, TL n K 1 is sum divisor cordial graph. Example.4. A sum divisor cordial labeling of TL 6 K 1 is shown in Figure.1 Theorem.5. The closed helm graph CH n is sum divisor cordial graph. Proof. Let G = CH n. Let V (G) ={v, v 1,v,,v n,u 1,u,,u n } and E(G) = {vv i,u i v i : 1 i n} S {v i v i+1,u i u i+1 : 1 i n 1} S {v 1 v n,u 1 u n }. Then, G is of order n +1 and size 4n. Define f : V (G) {1,,, n +1} as follows: f(v) =1; f(v i )=i;1 i n f(u i )=i +1;1 i n f (vv i )=0;1 i n f (v i v i+1 )=1;1 i n 1 f (v 1 v n )=1; f (u i v i )=0;1 i n f (u i u i+1 )=1;1 i n 1 f (u 1 u n )=1;
18 454 A. Lourdusamy and Jyotindra C. Prajapati We observe that, e f (0) = n and e f (1) = n. Thus, e f (1) e f (0) 1. Hence, CH n is sum divisor cordial graph. Example.6. A sum divisor cordial labeling of CH 4 isshowninfigure conclusion It is very interesting and challenging as well as to investigate graph families which admit sum divisor cordial labeling. Here we have proved D (K 1,n ), S 0 (K 1,n ), D (B n,n ), DS(B n,n ), S 0 (B n,n ), S(B n,n ), <K (1) 1,n K() 1,n >, S(L n), L n K 1, SL n, TL n, TL n K 1 and CH n are sum divisor cordial graphs. References [1] J. A. Gallian, A Dyamic Survey of Graph Labeling, The Electronic J. Combin., 18 (015) # DS6. [] F. Harary, Graph Theory, Addison-wesley, Reading, Mass, (197). [3] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Graphs, Proyecciones Journal of Mathematics, 35(1), pp , (016).
19 Sum divisor cordial labeling for star and ladder related graphs 455 [4] A. Lourdusamy and F. Patrick, Sum Divisor Cordial Labeling for Path and Cycle Related Graphs (submitted for publication) [5] S. S. Sandhya, S. Somasundaram and S. Anusa Some New Results on Root Square Mean Labeling, International Journal of Mathematical Archive, 5(1), pp , (014). [6] M. Seenivasan Some New Labeling Concepts, PhD thesis, Manonmaniam Sundaranar University, India, (013). [7] S. K. Vaidya and C. M. Barasara, Product Cordial Graphs in the Context of Some Graph Operations, International Journal of Mathematics and Scientific Computing, 1(), pp , (011). [8] S. K. Vaidya and N. H. Shah, Some Star and Bistar Related Cordial Graphs, Annals of Pure and Applied Mathematics, 3(1), pp , (013). [9] S. K. Vaidya and N. J. Kothari, Line Gracefulness of Some Path Related Graphs, International Journal of Mathematics and Scientific Computing, 4(1), pp , (014). A. Lourdusamy Department of Mathematics, St. Xavier s College (autonomous), Palayamkottai-6700, Tamilnadu, India lourdusamy15@gmail.com and F. Patrick Department of Mathematics, St. Xavier s College (autonomous), Palayamkottai-6700, Tamilnadu, India patrick881990@gmail.com
SQUARE 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 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 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 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 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 informationDifference 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 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 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 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 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 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 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 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 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 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 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 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 informationOne Modulo Three Root Square Mean Labeling of Some Disconnected Graphs
Annals of Pure and Applied Mathematics Vol. 6, No. 2, 208, 255-263 ISSN: 2279-087X (P), 2279-0888(online) Published on February 208 www.researchmathsci.org DOI: http://dx.doi.org/0.2257/apam.v6n2a Annals
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationTotal Mean Cordiality ofk c n + 2K 2
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:
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
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 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 informationMixed cycle-e-super magic decomposition of complete bipartite graphs
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir Mixed cycle-e-super magic decomposition of complete bipartite graphs G. Marimuthu, 1 and S. Stalin Kumar 2 1 Department of Mathematics,
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 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 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 informationIN this paper we consider simple, finite, connected and
INTERNATIONAL JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING (ISSN: -5), VOL., NO., -Eqitable Labeling for Some Star and Bistar Related Graphs S.K. Vaidya and N.H. Shah Abstract In this paper we proe
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
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 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 informationGiven any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer
Chapter 2 Topogenic Graphs Given any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer of G is an injective set-valued function f : V (G) 2 X such that the induced edge
More informationTopological indices: the modified Schultz index
Topological indices: the modified Schultz index Paula Rama (1) Joint work with Paula Carvalho (1) (1) CIDMA - DMat, Universidade de Aveiro The 3rd Combinatorics Day - Lisboa, March 2, 2013 Outline Introduction
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 informationDOMINATION INTEGRITY OF TOTAL GRAPHS
TWMS J. App. Eng. Math. V.4, N.1, 2014, pp. 117-126. DOMINATION INTEGRITY OF TOTAL GRAPHS S. K. VAIDYA 1, N. H. SHAH 2 Abstract. The domination integrity of a simple connected graph G is a measure of vulnerability
More informationH-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications () (014), 115 18 H-E-Super magic decomposition of graphs S. P. Subbiah a, J. Pandimadevi b a Department of Mathematics Mannar Thirumalai Naicker College
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationGraphoidal Tree d - Cover
International J.Math. Combin. Vol. (009), 66-78 Graphoidal ree d - Cover S.SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University, irunelveli 67 01, India) A.NAGARAJAN (Department of
More informationA total coloring of a graph G in an assignment of colors to the vertices and edges of G such that no two adjacent or incident
International Journal of Scientific and Research Publications, Volume 7, Issue 7, July 2017 616 Total Coloring of Closed Helm, Flower and Bistar Graph Family R. ARUNDHADHI *, V. ILAYARANI ** * Department
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 informationSome New Approaches for Computation of Domination Polynomial of Specific Graphs
Journal of Mathematical Extension Vol. 8, No. 2, (2014), 1-9 Some New Approaches for Computation of Domination Polynomial of Specific Graphs S. Alikhani Yazd University E. Mahmoudi Yazd University M. R.
More informationPAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu
More informationChapter 3. Antimagic Gl'aphs
Chapter 3 Antimagic Gl'aphs CHAPTER III ANTIMAGIC GRAPHS 3.1 Introduction In 1970 Kotzig and Rosa [81] defined the magic labeling of a graph G as a bijection f from VuE to {1,2,... IV u EI } such that
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 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 informationarxiv: v2 [cs.dm] 27 Jun 2017
H-SUPERMAGIC LABELINGS FOR FIRECRACKERS, BANANA TREES AND FLOWERS RACHEL WULAN NIRMALASARI WIJAYA 1, ANDREA SEMANIČOVÁ-FEŇOVČÍKOVÁ, JOE RYAN 1, AND THOMAS KALINOWSKI 1 arxiv:1607.07911v [cs.dm] 7 Jun 017
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 informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationOn the super edge-magic deficiency of some families related to ladder graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 51 (011), Pages 01 08 On the super edge-magic deficiency of some families related to ladder graphs Ali Ahmad Department of Mathematics GC University Lahore
More informationNEW METHODS FOR MAGIC TOTAL LABELINGS OF GRAPHS
NEW METHODS FOR MAGIC TOTAL LABELINGS OF GRAPHS A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Inne Singgih IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
More informationEven Star Decomposition of Complete Bipartite Graphs
Journal of Mathematics Research; Vol. 8, No. 5; October 2016 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Even Star Decomposition of Complete Bipartite Graphs E.
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 informationA Note on Disjoint Dominating Sets in Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 43, 2099-2110 A Note on Disjoint Dominating Sets in Graphs V. Anusuya Department of Mathematics S.T. Hindu College Nagercoil 629 002 Tamil Nadu, India
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 informationArithmetic ODD Decomposition of Extented Lobster
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-300 Volume 4, Number 1 (01), pp. 35-4 International Research Publication House http://www.irphouse.com Arithmetic ODD Decomposition
More informationElegant Labeled Graphs
Journal of Informatics and Mathematical Sciences Volume 2, Number 1 (2010), pp. 45 49 RGN Publications http://www.rgnpublications.com Elegant Labeled Graphs A. Elumalai and G. Sethuraman Abstract. An elegant
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
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 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 informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
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 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 informationSTUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS. R. ANANTHA KUMAR (Reg. No ) DOCTOR OF PHILOSOPHY
STUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS A THESIS Submitted by R. ANANTHA KUMAR (Reg. No. 200813107) In partial fulfillment for the award of the degree of DOCTOR OF PHILOSOPHY FACULTY
More informationAbsolutely Harmonious Labeling of Graphs
Iteratioal J.Math. Combi. Vol. (011), 40-51 Absolutely Harmoious Labelig of Graphs M.Seeivasa (Sri Paramakalyai College, Alwarkurichi-6741, Idia) A.Lourdusamy (St.Xavier s College (Autoomous), Palayamkottai,
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationarxiv: v3 [math.co] 25 Apr 2016
On incidence coloring conjecture in Cartesian products of graphs Petr Gregor, Borut Lužar, Roman Soták August 0, 08 arxiv:0.0908v [math.co] Apr 06 Abstract An incidence in a graph G is a pair (v, e) where
More informationDominating Broadcasts in Graphs. Sarada Rachelle Anne Herke
Dominating Broadcasts in Graphs by Sarada Rachelle Anne Herke Bachelor of Science, University of Victoria, 2007 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationIrredundance saturation number of a graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 37 49 Irredundance saturation number of a graph S. Arumugam Core Group Research Facility (CGRF) National Center for Advanced Research in Discrete
More information