Edge Fixed Steiner Number of a Graph
|
|
- Gavin Sparks
- 5 years ago
- Views:
Transcription
1 International Journal of Mathematical Analysis Vol. 11, 2017, no. 16, HIKARI Ltd, Edge Fixed Steiner Number of a Graph M. Perumalsamy 1, P. Arul Paul Sudhahar 2, J. John 3 and R. Vasanthi 1 1 Department of Mathematics Alagappa Chettiar College of Engineering and Technology Karaikudi-3, Tamilnadu, India 2 Department of Mathematics Rani Anna Government College for Women Tirunelveli-8, Tamilnadu, India 3 Department of Mathematics Government College of Engineering, Tirunelveli Tamilnadu, India Copyright c 2017 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract For a non-empty set W of vertices in a connected graph G, the Steiner distance d(w) of W is the minimum size of a connected subgraph of G containing W. Necessarily, each such subgraph is a tree and is called a Steiner tree with respect to W or a Steiner W-tree. S(W) denotes the set of vertices that lies in Steiner W-trees. Let G be a connected graph with at least 2 vertices. A set W V(G) is called a Steiner set of G if S(W) = V(G). The Steiner number s(g) is the minimum cardinality of a Steiner set. Let G be a connected graph with at least 3 vertices. For an edge e = xy in G, a set W V(G) {x, y} is called an edge fixed Steiner set of G if W = W {x, y} is a Steiner set of G. The minimum cardinality of an edge fixed Steiner set is called the edge fixed Steiner number of G and is denoted by s e (G). Also the Steiner W-tree necessarily contains the edge e and is called edge fixed Steiner W-tree. In this paper, we begin with an investigation of this parameter.
2 772 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi Keywords: Steiner set, edge fixed Steiner set, Steiner number, edge fixed Steiner number, diameter of a graph 1 Introduction By a graph G = (V, E), we mean a finite undirected connected graph without loops or multiple edges. The order and size of G are denoted by p and q respectively. The distance d(u,v) between two vertices u and v in a connected graph G is the length of a shortest u-v path in G. An u-v path of length d(u,v) is called an u-v geodesic. It is known that the distance is a metric on the vertex set of G. For a vertex v of G, the eccentricity e(v) is the distance between v and a vertex farthest from v. The minimum eccentricity among the vertices of G is called the radius and the maximum eccentricity is called the diameter of G and are denoted by rad G and diam G respectively. For basic graph theoretic terminology, we refer to Harary[5]. For a non-empty set W of vertices in a connected graph G, the Steiner distance d(w) of W is the minimum size of a connected subgraph of G containing W. Necessarily, each such subgraph is a tree and is called a Steiner tree with respect to W or a Steiner W-tree. A set W V of vertices in the graph G is called a Steiner set if every vertex in G lies in a Steiner-W-tree which is a minimum connected subgraph of G containing W. The Steiner number s(g) is the minimum cardinality of a Steiner set. A Steiner set with minimum cardinality is denoted as s-set. The edge fixed geodomination number of a graph was introduced by Santhakumaran and Titus[10]. In this paper, we introduce edge fixed Steiner number of a graph using Steiner sets in a graph. We provide the edge fixed Steiner number of some standard graphs. Also,we provide the bounds for edge fixed Steiner number through several parameters. For positive integers r, d and n 2 with r d 2r, there exists a connected graph G with rad G = r, diam G = d and s e (G) = n or n 1 for any edge e = xy in G. Also for any two positive integers a and b with 2 a b, there exists a connected graph G with s(g) = a and s e (G) = b for some edge e = xy in G. The follwoing theorems are used wherever required. Theorem 1.1. [3] Each extreme vertex of a graph G belongs to every Steiner set of G. In particular,each end vertex of G belongs to every Steiner set of G. Theorem 1.2. [3] Every non trivial tree with exactly k end vertices has Steiner number k.
3 Edge fixed Steiner number of a graph 773 Theorem 1.3. [3] For any cycle C P (p 3), s(c P ) = { 2 if p is odd 3 if p is even 2 Edge fixed Steiner number Definition 2.1. Let G be a simple connected graph with at least three vertices. For an edge e = xy in G, a set W V(G) {x, y} is called an edge fixed Steiner set of G if W = W {x, y} is a Steiner set of G. The minimum cardinality of an edge fixed Steiner set is called the edge fixed Steiner number of G and is denoted by s e (G). An edge fixed Steiner set with minimum cardinality is denoted by s e -set. Example 2.2. Consider the graph G shown in Figure 1. v 2 v 3 v 1 v 4 v 6 v 5 Figure 1: The minimum edge fixed Steiner sets for each edge e of G and the corresponding edge fixed Steiner numbers of G are given in the following table. Edge e s e -sets s e (G) v 1 v 2 {v 4, v 5 } 2 v 2 v 3 {v 1, v 4, v 5, v 6 } 4 v 3 v 4 {v 1, v 6 } 2 v 4 v 5 {v 1, v 2 } 2 v 5 v 6 {v 1, v 2, v 3, v 4 } 4 v 6 v 1 {v 3, v 4 } 2 v 2 v 6 {v 1, v 4 } 2 v 3 v 5 {v 1, v 4 } 2 Theorem 2.3. If G is any connected graph G of order p and e is an edge of G, then 1 s e (G) p 2. Proof: Let G be a connected graph with at least three vertices. Let e = xy be an edge of G and let W be an edge fixed Steiner set of G.
4 774 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi Then W V(G) {x, y}. Therefore s e (G) 1. Also since the vertices x and y do not belong to any edge fixed Steiner set W, it follows that s e (G) p 2. Therefore 1 s e (G) p 2 for every edge e in G. Remark 2.4. The bounds for s e (G) are sharp. { 1 if e is an end edge of Pp Theorem 2.5. For the path P p with p 3, s e (P p ) = 2 otherwise Proof: Let V (P p ) = {v 1, v 2,..., v p }. Case 1: Let e be an end edge of P p. Then e = v 1 v 2 or v p 1 v p. If e = v 1 v 2, then {v p } is the edge fixed Steiner set of P p. Similarly, if e = v p 1 v p, then {v 1 } is the edge fixed Steiner set of P p. Therefore s e (P p ) = 1. Case 2: Let e be any internal edge of P p. Then {v 1, v p } is the edge fixed Steiner set of P p. Therefore s e (P p ) = 2. Theorem { 2.6. If C p is a cycle of order p and e is any edge of C p, then 1 if p is odd s e (C p ) = 2 if p is even Proof: Let e = xy be any edge of C p. Case 1: Let p be odd. Choose a vertex u such that d(x, u) = d(y, u) = p 1. Then {u} is an edge 2 fixed Steiner set of C p. Therefore s e (C p ) = 1. Case 2: Let p be even. It is easily verified that no singleton set of C p is an s e -set of C p and so s e (C p ) 2. Let u and v be the antipodal vertices of x and y respectively. Then W = {x, y} is an edge fixed Steiner set of G so that s e (C p ) = 2. Theorem 2.7. For any complete graph K p with p 3, s e (K p ) = p 2 where e is any edge of K p. Theorem 2.8. Let e = xy be any edge of a connected graph G of order at least 3. Then every extreme vertex of G, other than the vertices x and y (whether x and y are extreme vertices or not) belongs to every edge fixed Steiner set in G. In particular, every end vertex of G other than x and y belongs to every edge fixed Steiner set of G.
5 Edge fixed Steiner number of a graph 775 Proof: Let e = xy be any edge of G and let W be an edge fixed Steiner set of G. By the definition of edge fixed Steiner set, x and y do not belong to it. So let v x, v y be an extreme vertex of G. Let W =W {x, y}. Then W is a Steiner set of G. Suppose that v / W. Then v / W. Since W is a Steiner set of G, the vertex v lies on a Steiner-W -tree T so that W V(T) and v V(T). Let deg T v = k. If k = 1, then v is an end vertex of the Steiner-W -tree T. Since every end vertex of a Steiner-W -tree belongs to W, it follows that v W which is a contradiction. Hence v W. If k 2, let N T (v) = {u 1, u 2,...,u k } be the neighbourhood of v in T. Since v is an extreme vertex of G, it follows that u i u j E(G) for all i, j with 1 i, j k and i j. Let T be the tree in G obtained from T by deleting the vertex v and adding k 1 edges u i u i+1, 1 i k 1. Then W V(T ) and V (T ) = V (T ) 1. This is a contradiction since T is a Steiner-W -tree. Hence v W. Corollary 2.9. If G is a connected graph with k extreme vertices and e = xy is any edge of G, then (i) max.{1, k} s e (G) p 2 if neither x nor y is an extreme vertex of G (ii) max.{1, k 1} s e (G) p 2 if either x or y is an extreme vertex of G (iii) max.{1, k 2} s e (G) p 2 if both x and y are extreme vertices of G. Corollary Let T be any non trivial tree and k be the number of end vertices in T. Let e = xy be any edge of T. Then { k if neither x nor y is an end vertex of T s e (T ) = k 1 if either x or y is an end vertex of T Proof: Case 1: Let e = xy where neither x nor y is an end vertex of T. Let W = {u 1, u 2,...,u k } be the set of all end vertices of T. Then by Corollary 2.9(i), s e (T ) k. Also it is clear that W is an edge fixed Steiner set of T so that s e (T ) k. Therefore s e (T ) = k. Case 2: Let e = xy where either x or y is an end vertex of T. Suppose x is an end vertex of T. Then by Corollary 2.9(ii), s e (T ) k 1. Let W = {u 1, u 2,...,u k } be the set of all end vertices of T. Then x W. Now let W = W {x}. Then W is an edge fixed Steiner set of G. Therefore s e (T ) k 1. Thus s e (T ) = k 1. Similarly if y is an end vertex of T, then also s e (T ) = k 1.
6 776 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi Theorem Let e = xy be any edge of a connected graph G of order at least 3. Let v be a cut-vertex of G and W be an edge fixed Steiner set of G. (i) If v = x or y, then every component of G v contains an element of W. (ii) If v x and v y, then for each component C of G v with x, y / C, W C Φ. Proof: (i) Let v = x or y. Suppose there exists a component say G 1 of G v such that G 1 contains no vertex of W. By Theorem 2.8, W contains all the extreme vertices of G and hence G 1 does not have any extreme vertex of G. Thus G 1 contains at least one edge say uw distinct from xy. Since every edge fixed Steiner W-tree T must have its end vertex in W and v is a cut vertex of G, it is clear that no edge fixed Steiner W-tree would contain the edge uw. It contradicts that W is an edge fixed Steiner set of G. (ii) Let v x and v y. Suppose there exists a component say C of G v with x, y / C, W C = Φ. Then proceeding as in (i), we arrive at a contradiction. Corollary If e is a cut-edge of a connected graph G and W is an edge fixed Steiner set of G, then e lies on a Steiner W- tree of G. Corollary If v is a cut-vertex of a connected graph G and W is an edge fixed Steiner set of G, then v lies on a Steiner W- tree of G. Theorem No cut - vertex of a connected graph G belongs to any minimum edge fixed Steiner set of G. Proof: Let v be a cut-vertex of G and W be a minimum edge fixed Steiner set of G. We claim that v / W. Suppose that v W. Let G 1, G 2, G 3,... G r (r 2) be the components of G v. By Theorem 2.11, each component G i (1 i r) contains an element of W. Let W = W {v}. Then by Corollary 2.13, each edge fixed Steiner W- tree contains v since v is a cut vertex. Now, since v / W ; it follows that each edge fixed Steiner W- tree is also an edge fixed Steiner W - tree of G. Thus W is also an edge fixed Steiner set of G such that W < W. This is a contradiction since W is a minimum edge fixed Steiner set of G. Theorem For any edge e in the complete bipartite graph K m,n with m n and m + n 3, s e (K m,n ) = m + n 2.
7 Edge fixed Steiner number of a graph 777 Proof: Let U = {u 1, u 2,...,u m } and V = {v 1, v 2,...,v n } be the bipartition of K m,n. Let e = u i v j, 1 i m, 1 j n be an edge in K m,n. Let W = V {u i, v j }. Then clearly W is an edge fixed Steiner set of K m,n so that s e (K m,n ) m + n 2. Let X be a subset of the vertex set of K m,n such that X m + n 2. If X U V then X is connected. Hence X is not an s e -set of G. Thus s e (K m,n ) = m + n 2. Theorem { For any edge e in the wheel W p = K 1 + C p 1 (p 6), p 5 if e is an edge in Cp 1 s e (W p )= p 2 otherwise Proof: Let {w, u 0, u 1, u 2,...,u p 2 } be the vertex set of W p where w K 1 and u 0, u 1, u 2,...,u p 2 C p 1. For instance, the wheel W 7 is as shown in Figure 2. u 0 u 1 u 5 w u 2 u 4 u 3 Figure 2: W 7 Case 1: Let e = u i u i+1 be an edge in C p 1 where i = 0, 1, 2,..., p 2. Let W = {u (i+3)mod(p 1), u (i+4)mod(p 1),...,u (i+p 3)mod(p 1) } and let W = W {u i, u i+1 }. Then the path T 1 : u imod(p 1), u (i+1)mod(p 1), u (i+2)mod(p 1), u (i+3)mod(p 1),..., u (i+p 4)mod(p 1),u (i+p 3)mod(p 1) is a Steiner W -tree. Similarly the path T 2 : u (i+1)mod(p 1), u imod(p 1), u (i+p 2)mod(p 1), u (i+p 3)mod(p 1),...,u (i+4)mod(p 1), u (i+3)mod(p 1) is another Steiner W -tree. It is clear that G = W p - {u (i+2)mod(p 1), u (i+p 2)mod(p 1) } is also connected. Then any spanning tree T 3 of G is necessarily a Steiner W -tree. So T 1, T 2 and T 3 are the Steiner W -trees containing W. Also W is the unique Steiner set of W p and hence W is the unique edge fixed Steiner set of W p. So in this case, s e (W p ) = p 5. Case 2: Let e be an edge not in C p 1. Then e = wu i where i = 0, 1, 2,... p 2. Let W = {u 0, u 1, u 2,..., u i 1, u i+1,..., u p 2 } and W = W {w, u i } = V(W p ). Then the star centered at w is the Steiner W -tree containing W. So W is the unique edge fixed Steiner set of W p. Hence in this case, s e (W p ) = p 2.
8 778 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi Theorem For any edge e in the n - cube Q n (n 2), s e (Q n )= 2. Proof: For n = 4, the hypercube Q 4 is represented as shown in Figure Figure 3: Q 4 Let e = xy be any edge in Q n which contains 2 n vertices. Then x and y are of the form a 1 a 2 a 3...a n where a i {0, 1}. Since x and y are adjacent, they differ by 0 and 1 in only one position. Let W = {x c, y c } and W = W {x, y}. Since x and y differ by 0 and 1 in exactly one position, x c and y c also differ by 0 and 1 in exactly one position. So they are adjacent in Q n. Then any x-y c path containing y and x c is a Steiner W -tree. Similarly, any y-x c path containing x and y c is also a Steiner W -tree. It is possible to find such Steiner W -trees which cover all the vertices of Q n. Also W is the unique Steiner set of Q n and W is the unique edge fixed Steiner set of Q n. So s e (Q n ) = 2. Theorem Let G be a connected graph. For any edge e = uv in G, s e (G) = 1 if and only if there exists a vertex y such that every vertex of G is on a diametral path joining either u and y or a diametral path joining v and y. Proof: Let e = uv be any edge in G. Let y be any vertex distinct from u and v of G such that every vertex of G is on a diametral path P joining either u and y or a diametral path joining v and y. Let W = {y}. We know that s e (G) 1. Since P is a diametral path joining either u and y or a diametral path joining v and y, it is clear that each
9 Edge fixed Steiner number of a graph 779 vertex of G is on a geodesic joining either u and y or a geodesic joining v and y and also every u-y geodesic or v-y geodesic is an edge fixed Steiner tree of G. Therefore W is a edge fixed Steiner set of G. Thus s e (G) 1. Hence s e (G) = 1. Conversely, let s e (G) = 1. Let W = {y} be a minimum edge fixed Steiner set of G. Since every edge fixed Steiner tree in G is either u-y geodesic or v-y geodesic, each vertex of G also lies on either u-y geodesic or v-y geodesic. We claim that d(u,y) = d(g) or d(v,y)= d(g). Suppose that d(u,y) < d(g). Then let w and x be any two vertices of G such that d(w,x) = d(g). Now it follows that w and x lie on distinct geodesics joining u and y. Hence d(u,y) = d(u,w)+d(w,y)...(1). And d(u,y)= d(u,x)+d(x,y)...(2). By the triangle inequality, d(w,x) d(w,u)+d(u,x)...(3). Since d(u,y) < d(w,x) d(w,u)+d(u,x) by (3). That is, d(u,y) < d(w,u)+d(u,x)...(4). Using (4) in (1), we have d(w,y) < d(w,u)+d(u,x) d(u,w) = d(u,x). Thus d(w,y)< d(u,x)...(5). Also by the triangle inequality, we have d(w,x) d(w,y)+d(y,x)...(6). Using (5) and (2) in (6),we have d(w,x) < d(u,x)+d(u,y) d(u,x) = d(u,y). Thus d(g) < d(u,y) which is a contradiction. Hence d(u,y) = d(g). Similarly, we have d(v,y) = d(g). Therefore either d(u,y) = d(g) or d(v,y) = d(g). Thus each vertex of G is on a diametral path joining either u and y or a diametral path joining v and y. Theorem If G is a connected graph of order p, then s e (G) < p 2 if and only if there exists an edge fixed Steiner set W such that W {u, v} is disconnected for any edge e = uv in G. Proof: Let e = uv be any edge in G. Assume that s e (G) < p 2. Let W be an edge fixed Steiner set of G. We claim that W {u, v} is disconnected. Suppose that W {u, v} is connected. Then the edge fixed Steiner tree of G contains the members of W {u,v} only, which is a contradiction to W is an edge fixed Steiner set of G. So W {u, v} is disconnected. Conversely, let e = uv be any edge of G. Let W be an edge fixed Steiner set of G such that W {x, y} is disconnected. We claim that s e (G) < p 2. Suppose that s e (G) = p 2. Then G is complete and W = V (G) {u,v} is the unique edge fixed Steiner set of G such that W {u, v} is connected. This is a contradiction. So s e (G) < p 2.
10 780 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi 3 Edge fixed Steiner number and diameter of a graph We know that if G is a connected graph of order p 3, then 1 s e (G) p 2 for any edge uv in G. Also we have for an edge uv in G, s e (G) = 1 if and only if there exists a vertex y such that every vertex of G lies on either a diametral path joining u and y or a diametral path joining v and y. Here we give a strong upper bound for the edge fixed Steiner number of a graph by using its order and diameter. Theorem 3.1. For any edge e = xy in a nontrivial tree, s e (G) = p d or p d+1 if and only if T is a caterpillar. Proof: Let T be a non trivial tree. Let P: v 0, v 1, v 2,...,v d = v be a diametral path. Let k be the number of end vertices of T and l be the number of internal vertices of T other then v 1, v 2,...,v d 1. Then d 1 + l + k = p. By Corollary 2.13, s e (G) = k or k 1 for any edge xy in T. Hence s e (G) = p d l + 1 or p d l for any edge e in T. It implies that s e (G) = p d + 1 or p d if and only if l = 0 (i.e)if and only if all the internal vertices of T lie on a diametral path P (i.e)if and only if T is a caterpillar. For every connected graph G, rad G diam G 2 rad(g). Ostrand [7] proved that every two positive integers a and b with a b 2a are realizable as the radius and diameter, respectively, of some connected graph. It is extended for the edge fixed Steiner number also as follows. Theorem 3.2. For positive integers r, d and n 2 with r d 2r, there exists a connected graph G with rad G = r, diam G = d and s e (G) = n or n 1 for any edge e = xy in G. Proof: Let e = xy be any edge in G. When r = 1, we have d = 1 or 2. If d = 1, let G = K n+2. Then by Theorem 2.15, s e (G) = n for any edge e = xy in G. If d = 2, let G = K 1,n+1. By the Theorem 2.15, s e (G) = n for any edge e = xy in G. Let r 2. We construct a graph G with required properties as follows. Case 1: Let r = d. For n = 2, let G = C 2r. Then we have done s e (G) = 2 for all e in G. Now, let n 3. Let C 2r : { u 1, u 2,...,u 2r, u 1 } be a cycle of order 2r. Let G be the graph obtained by adding new vertices { x 1, x 2,...,x n 2 } and
11 Edge fixed Steiner number of a graph 781 joining each x i ( 1 i n 2 ) with u 1 and u 2 of C 2r. Then the graph G thus obtained is shown in Figure 4. u 2r 1 u 2r u 4 u 1 x n 3 x n 2 C 2r x 1 x 2 u 3 u 2 Figure 4: G It is seen that the eccentricity of each vertex of G is r so that rad G = diam G = r. Also S = { x 1, x 2,...,x n 1 } is the set of all extreme vertices of G with S = n 1. Let U = { u 1, u 2,...,u 2r }. Let e = xy where x, y U. By Theorem 2.8, S is contained in every edge fixed Steiner set of G. It is clear that S is not an edge fixed Steiner set of G and so s e (G) n. Let u and v be the antipodal vertices of x and y respectively in C 2r. Then it follows from Theorem 2.8 that S {u, v} is an edge fixed Steiner set of G so that s e (G) = n. Let e = u 1 x i or u 2 x i where x i S for i = 1, 2,...,n 1. Then by Theorem 2.8, S {x i } for i = 1, 2,...,n 1 is contained in every edge fixed Steiner set of G. It is clear that S {x i } is not an edge fixed Steiner set of G. Let u V(C 2r ) where u u 1, u 2. Then S {x i } {u} is not an edge fixed Steiner set of G and so s e (G) n. Let w and z be two antipodal vertices of x i. Then W = S {x i } {w,z} is an edge fixed Steiner set of G and hence s e (G) = n. Case 2: Suppose r < d. Let C 2r : (v 1, v 2,...,v 2r, v 1 ) be a cycle of order 2r and let P d r+1 : u 0, u 1,...,u d r be the path of order d r + 1. Let H be the graph obtained from C 2r and P d r+1 by identifying v 1 in C 2r and u 0 in P d r+1. If n = 2, then let G = H. Let e = xy be any edge in G. Clearly s e (G) = 1 or 2 according as xy {v r v r+1, v r+1 v r+2, u d r 1 u d r } or xy {v 1 u 1, u 1 u 2, u 2 u 3,...,u d r 2 u d r 1, v 1 v 2, v 2 v 3,...,v r 1 v r, v r+2 v r+3,..., v 2r v 1 }. If n 3, then add (n 2) new vertices w 1, w 2,...,w n 2 to H and joining each vertex w i ( 1 i n 2 ) to the vertex u d r 1 and obtain the graph G, which is shown in Figure 5. Now rad G = r and diam G = d and G has n 1 end vertices.
12 782 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi v r+2 v 2r v r+1 vr u 1 u 2 u d r 1 u d r C 2r v 1 = u 0 w n 2 v w 1 2 w 2 Figure 5: G Clearly s e (G) = n or n 1 according as xy {v 1 u 1, u 1 u 2,..., u d r 2 u d r 1, v 1 v 2, v 2 v 3,..., v r 1 v r, v r+2 v r+3,..., v 2r v 1 } or xy {v r v r+1 4, v r+1 v r+2, u d r 1 u d r, u d r w 1, u d r w 2,..., u d r w n 2 }. 4 The Steiner number and edge fixed Steiner number of a graph In this section, we establish the equivalence of minimum Steiner set and minimum edge fixed Steiner set in a connected graph with cut edges. We determine the relation between the Steiner number and the edge fixed Steiner number of a graph. Also for any two positive integers a and b with 2 a b, we construct a connected graph G with s(g) = a and s e (G) = b for some edge e = xy in G. Theorem 4.1. Let G be a connected graph with cut edges. Let e = xy be a cut edge in G. Then W V(G) is an s e -set of G if and only if W is an s-set of G. Proof: Let e = xy be a cut edge in G. Let W be an s e -set of G. If W is not an s-set of G, then there exists a set W with W < W such that W is a minimum Steiner set of G. Since e is a cut edge of G, both x and y lie on every edge fixed Steiner W -tree of G. Hence it follows that W is an s e -set of G which leads to a contradiction. Therefore W is an s-set of G. Conversely, Let W be an s-set of G. Since e = xy is a cut edge of G, both x and y lie in every Steiner W tree of G. Hence it is clear that W is an edge fixed Steiner set of G. Suppose that W is not an s e -set of G. Then there exists a set W with W < W such that W is an s e -set of G. Hence every vertex of G lies on an edge fixed Steiner W tree of G. Also since x, y belong to every edge fixed Steiner W tree of G, every edge fixed Steiner W tree of G is also a Steiner W tree of G. So it follows that W is a Steiner set of G which is a contradiction. Hence W is an s e -set of G.
13 Edge fixed Steiner number of a graph 783 Corollary 4.2. Let e = xy be a cut edge of a connected graph G. Then s e (G) = s(g). The corollary immediately follows from Theorem 4.1. Remark 4.3. The converse of the Corollary 4.2 need not be true. For example, consider the graph G shown in Figure 1. As illustrated in Example 2.2, W = {v 1, v 4 } is the minimum Steiner set of G so that s(g) = 2. Also for the edges v 2 v 6 and v 3 v 5, W = {v 1, v 4 } is the minimum edge fixed Steiner set of G. Hence s e (G) = 2 = s(g). But v 2 v 6 and v 3 v 5 are not cut edges of G. Theorem 4.4. For any edge e = xy in G, s(g) s e (G) + 2. Proof: Let e = xy be any edge in G and W be an edge fixed Steiner set of G. Then W {x,y} is a Steiner set of G so that s(g) W {x, y} = s e (G) + 2. Theorem 4.5. For any edge e = xy in G, s(g) = s e (G) + 2 if and only if the x and y belong to a minimum Steiner set of G. Proof: Let W be a minimum Steiner set of G and e = xy be an edge in G such that x, y W. Then W {x,y} is an edge fixed Steiner set of G so that s e (G) W {x, y} = s(g) 2. It implies that s e (G) + 2 s(g). From Theorem 4.4, we have s e (G) + 2 s(g). Therefore s(g) = s e (G) + 2. Conversely, let s(g) = s e (G) + 2 for any edge e = xy in G. Let W be a minimum edge fixed Steiner set of G. Then W = W {x,y} is a Steiner set of G. Since cardinality of W = s e (G) + 2. it follows that W is a minimum Steiner set of G with x, y W. Hence the theorem. Theorem 4.6. For any two positive integers a and b with 2 a b, there exists a connected graph G with s(g) = a and s e (G) = b for some edge e = xy in G. Proof: Case 1: Let a = b. When a = 2, for any edge e in an even cycle G, we have s e (G) = 2 by Theorem 2.6 and s(g) = 2 by Theorem 1.3. Now a = b with b 3 and 3 a = b. Let G be a tree with a end vertices. Then by theorem 1.2, s(g) = a. Let e = xy be an intermediate vertex of G. Then by Corollary 2.13 s e (G) = a. Case 2: 3 < a < b.
14 784 M. Perumalsamy, P. Arul Paul Sudhahar, J. John and R. Vasanthi Let G be the graph obtained in Figure 6 from the path P on the vertices: u 1, u 2, u 3, by adding the new vertices v 1, v 2,...,v b a+2 and w 1, w 2,...,w a 2 and joining each v i (1 i b - a + 2) with u 1 and u 3 and also joining each w i (1 i a-2) with u 1 and u 2. Let W = {w 1, w 2,...,w a 2 }. Then W is the set of extreme vertices of G. w a 2 w 2 w 1 u 1 u 2 u 3 v 1 v 2 v 3 v b a+1 Figure 6: Let S be any Steiner set of G. Then by Theorem 1.1, W S. It is clear that W is not a Steiner set of G. Also it is verified that W = W {v}, where v/ W is not a Steiner set of G. But, it is seen that W {u 1, u 3 } is a Steiner set of G and so s(g) = a. Next, we prove that s e (G) = b for some e G. Let e = u 3 v 2. By Theorem 2.8, W is a subset of every s e set of G. It is clear that W is not an edge fixed Steiner set of G. Also, it is easily seen that every edge fixed Steiner set contains each v i (1 i b - a + 1) except the vertices u 3, v 2 and so s e (G) a-2+b-a+1 = b 1. It is easily verified that Z = W {v 1, v 2,...,v b a+1 } (except the vertices u 3, v i ) is not an s e set of G and so s e (G) b. Now Z = Z {u 1 } is an s e set of G so that s e (G) = b. References [1] F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
15 Edge fixed Steiner number of a graph 785 [2] G. Chartrand F. Harary and P. Zang, On the geodetic number of a graph, Networks, 39 (2002), [3] G. Chartrand and P. Zhang, The Steiner number of a graph, Discrete Mathematics, 242 (2002) [4] Gary Chatrand and Ping Zhang,Introduction to Graph Theory, Tata Mc- Graw Hill Education Private Limited, New Delhi, Eighth Reprint, [5] F. Harary, Graph Theory, Addison-Wesley, Reading, MA, [6] F. Harary, E. Loukakis, C. Tsouros, The geodetic number of a graph, Math. Comput. Modeling, 17 (1993), no. 11, [7] P.A. Ostrand, Graphs with specified radius and diameter, Discrete Math., 4 (1973), [8] A.P. Santhakumaran, P. Titus, Vertex Geodomination in Graphs, Bulletin of Kerala Mathematics Association, 2 (2005), no. 2, [9] A. P. Santhakumaran and J. John, The edge Steiner number of a graph, Journal of Discrete Mathematical Science and Cryptography, 10 (2007), no. 5, [10] A.P. Santhakumaran and P. Titus, The edge fixed geodomination number of a graph, An. St. Univ. Ovidius Constanta, 17 (2009), no. 1, Received: July 14, 2017; Published: August 11, 2017
Distance in Graphs - Taking the Long View
AKCE J Graphs Combin, 1, No 1 (2004) 1-13 istance in Graphs - Taking the Long View Gary Chartrand 1 and Ping Zhang 2 epartment of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA 1 e-mail:
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationMore on Tree Cover of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 12, 575-579 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.410320 More on Tree Cover of Graphs Rosalio G. Artes, Jr.
More informationRestrained Independent 2-Domination in the Join and Corona of Graphs
Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3171-3176 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.711343 Restrained Independent 2-Domination in the Join and Corona of Graphs
More informationSecure Weakly Convex Domination in Graphs
Applied Mathematical Sciences, Vol 9, 2015, no 3, 143-147 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams2015411992 Secure Weakly Convex Domination in Graphs Rene E Leonida Mathematics Department
More informationInduced Cycle Decomposition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 84, 4165-4169 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.5269 Induced Cycle Decomposition of Graphs Rosalio G. Artes, Jr. Department
More informationIndependent Transversal Equitable Domination in Graphs
International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner
More informationSecure Weakly Connected Domination in the Join of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 14, 697-702 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.519 Secure Weakly Connected Domination in the Join of Graphs
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 informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
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 informationThe Dominating Graph DG bcd (G) of a Graph G
The Dominating Grah (G) of a Grah G M. Bhanumathi 1, J. John Flavia 2 1 Associate Professor, Government Arts College for Women, Pudukkottai, TN, India 2 Research Scholar, Government Arts College for Women,
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 informationDouble Total Domination in Circulant Graphs 1
Applied Mathematical Sciences, Vol. 12, 2018, no. 32, 1623-1633 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.811172 Double Total Domination in Circulant Graphs 1 Qin Zhang and Chengye
More informationLocating Chromatic Number of Banana Tree
International Mathematical Forum, Vol. 12, 2017, no. 1, 39-45 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.610138 Locating Chromatic Number of Banana Tree Asmiati Department of Mathematics
More informationRestrained Weakly Connected Independent Domination in the Corona and Composition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 20, 973-978 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121046 Restrained Weakly Connected Independent Domination in the Corona and
More informationSecure Connected Domination in a Graph
International Journal of Mathematical Analysis Vol. 8, 2014, no. 42, 2065-2074 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47221 Secure Connected Domination in a Graph Amerkhan G.
More informationp-liar s Domination in a Graph
Applied Mathematical Sciences, Vol 9, 015, no 107, 5331-5341 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ams0155749 p-liar s Domination in a Graph Carlito B Balandra 1 Department of Arts and Sciences
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationDouble Total Domination on Generalized Petersen Graphs 1
Applied Mathematical Sciences, Vol. 11, 2017, no. 19, 905-912 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.7114 Double Total Domination on Generalized Petersen Graphs 1 Chengye Zhao 2
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 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 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 informationAnother Look at p-liar s Domination in Graphs
International Journal of Mathematical Analysis Vol 10, 2016, no 5, 213-221 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma2016511283 Another Look at p-liar s Domination in Graphs Carlito B Balandra
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
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 Annihilator Small Intersection Graph
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 283-289 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7931 On Annihilator Small Intersection Graph Mehdi
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationRainbow Connection Number of the Thorn Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6373-6377 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48633 Rainbow Connection Number of the Thorn Graph Yixiao Liu Department
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 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 informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
More informationDecompositions of Balanced Complete Bipartite Graphs into Suns and Stars
International Journal of Contemporary Mathematical Sciences Vol. 13, 2018, no. 3, 141-148 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2018.8515 Decompositions of Balanced Complete Bipartite
More informationChromatic Connectivity of Graphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-206 Chromatic Connectivity of Graphs Elliot Laforge Western Michigan University Follow this and additional works at: https://scholarworkswmichedu/dissertations
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
More informationThe Rainbow Connection of Windmill and Corona Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6367-6372 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48632 The Rainbow Connection of Windmill and Corona Graph Yixiao Liu Department
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationLocating-Dominating Sets in Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 88, 4381-4388 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46400 Locating-Dominating Sets in Graphs Sergio R. Canoy, Jr. 1, Gina A.
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 informationSome Properties of D-sets of a Group 1
International Mathematical Forum, Vol. 9, 2014, no. 21, 1035-1040 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.45104 Some Properties of D-sets of a Group 1 Joris N. Buloron, Cristopher
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 informationThe 3-rainbow index of graph operations
The 3-rainbow index of graph operations TINGTING LIU Tianjin University Department of Mathematics 300072 Tianjin CHINA ttliu@tju.edu.cn YUMEI HU Tianjin University Department of Mathematics 300072 Tianjin
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Varaporn Saenpholphat; Ping Zhang Connected resolvability of graphs Czechoslovak Mathematical Journal, Vol. 53 (2003), No. 4, 827 840 Persistent URL: http://dml.cz/dmlcz/127843
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 informationOn Regular Prime Graphs of Solvable Groups
International Journal of Algebra, Vol. 10, 2016, no. 10, 491-495 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2016.6858 On Regular Prime Graphs of Solvable Groups Donnie Munyao Kasyoki Department
More informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
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 informationDistance-related Properties of Corona of Certain Graphs
Distance-related Properties of Corona of Certain Graphs S. Sriram, Atulya K. Nagar, and K.G. Subramanian Department of Mathematics, VELS University, Pallavaram, Chennai 600 042 India e-mail:sriram.discrete@gmail.com
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn the metric dimension of the total graph of a graph
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 4, 82 95 On the metric dimension of the total graph of a graph B. Sooryanarayana 1, Shreedhar
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationModular Monochromatic Colorings, Spectra and Frames in Graphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 12-2014 Modular Monochromatic Colorings, Spectra and Frames in Graphs Chira Lumduanhom Western Michigan University, chira@swu.ac.th
More informationA characterization of graphs by codes from their incidence matrices
A characterization of graphs by codes from their incidence matrices Peter Dankelmann Department of Mathematics University of Johannesburg P.O. Box 54 Auckland Park 006, South Africa Jennifer D. Key pdankelmann@uj.ac.za
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 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 informationResearch Article Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2008, Article ID 468583, 11 pages doi:10.1155/2008/468583 Research Article Bipartite Diametrical Graphs
More informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
More informationConnectivity of graphs with given girth pair
Discrete Mathematics 307 (2007) 155 162 www.elsevier.com/locate/disc Connectivity of graphs with given girth pair C. Balbuena a, M. Cera b, A. Diánez b, P. García-Vázquez b, X. Marcote a a Departament
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
More informationOn the Union of Graphs Ramsey Numbers
Applied Mathematical Sciences, Vol. 8, 2014, no. 16, 767-773 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.311641 On the Union of Graphs Ramsey Numbers I Wayan Sudarsana Combinatorial
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationHighly Hamiltonian Graphs and Digraphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-017 Highly Hamiltonian Graphs and Digraphs Zhenming Bi Western Michigan University, zhenmingbi@gmailcom Follow this and
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationbe a path in L G ; we can associated to P the following alternating sequence of vertices and edges in G:
1. The line graph of a graph. Let G = (V, E) be a graph with E. The line graph of G is the graph L G such that V (L G ) = E and E(L G ) = {ef : e, f E : e and f are adjacent}. Examples 1.1. (1) If G is
More informationInverse and Disjoint Restrained Domination in Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 11, No.1, 2016, 9-15 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 17 August 2016 www.researchmathsci.org International Journal of Inverse and Disjoint
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThe Simultaneous Local Metric Dimension of Graph Families
Article The Simultaneous Local Metric Dimension of Graph Families Gabriel A. Barragán-Ramírez 1, Alejandro Estrada-Moreno 1, Yunior Ramírez-Cruz 2, * and Juan A. Rodríguez-Velázquez 1 1 Departament d Enginyeria
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 informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
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 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 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 informationTHE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2
LE MATEMATICHE Vol LXVIII (2013) Fasc II, pp 167 190 doi: 104418/201368213 THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 K F BENSON - M PORTER - M TOMOVA A radio labeling of a simple connected
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More informationOn Modular Colorings of Caterpillars
On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada
More informationTHE GRAPH OF DIVISOR FUNCTION D(n) Srinivasa Ramanujan Centre SASTRA University Kumbakonam, , INDIA
International Journal of Pure and Applied Mathematics Volume 102 No. 3 2015, 483-494 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v102i3.6
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 informationDevaney's Chaos of One Parameter Family. of Semi-triangular Maps
International Mathematical Forum, Vol. 8, 2013, no. 29, 1439-1444 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.36114 Devaney's Chaos of One Parameter Family of Semi-triangular Maps
More informationRADIO ANTIPODAL COLORINGS OF GRAPHS
17 (00) MATHEMATICA BOHEMICA No. 1, 57 69 RADIO ANTIPODAL COLORINGS OF GRAPHS Gary Chartrand, David Erwin, Ping Zhang 1, Kalamazoo (Received May 1, 000) Abstract. A radio antipodal coloring of a connected
More informationAugmenting Outerplanar Graphs to Meet Diameter Requirements
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia Augmenting Outerplanar Graphs to Meet Diameter Requirements Toshimasa Ishii Department of Information
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
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 informationEnumeration of unlabeled graphs such that both the graph and its complement are 2-connected
SUT Journal of Mathematics Vol. 52, No. 1 (2016), 41 47 Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected Kumi Kobata, Shinsei Tazawa and Tomoki Yamashita (Received
More informationOn Symmetric Bi-Multipliers of Lattice Implication Algebras
International Mathematical Forum, Vol. 13, 2018, no. 7, 343-350 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2018.8423 On Symmetric Bi-Multipliers of Lattice Implication Algebras Kyung Ho
More informationConvex Subgraph Polynomials of the Join and the Composition of Graphs
International Journal of Mathematical Analysis Vol 10, 2016, no 11, 515-529 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma2016512296 Convex Subgraph Polynomials of the Join and the Composition
More informationAn Exact Formula for all Star-Kipas Ramsey Numbers
Graphs and Combinatorics 017) 33:141 148 DOI 10.1007/s00373-016-1746-3 ORIGINAL PAPER An Exact Formula for all Star-Kipas Ramsey Numbers Binlong Li 1, Yanbo Zhang 3,4 Hajo Broersma 3 Received: June 015
More information