DOCSLIB.ORG

2166 Reserved Domination Number of Some Graphs Dr. G. Rajasekar1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
2166 Reserved Domination Number of Some Graphs Dr. G. Rajasekar1 Turkish Journal of Computer and Mathematics Education Vol.12 No.11 (2021), 2166-2181 Research Article Reserved Domination Number of some Graphs Dr. G. Rajasekar1, G. Rajasekar2 1Associate Professor, PG and Research Department of Mathematics, Jawahar Science College, Neyveli 2Research Scholar, PG and Research Department of Mathematics, Jawahar Science College, Neyveli [email protected]., [email protected] Article History: Received: 10 January 2021; Revised: 12 February 2021; Accepted: 27 March 2021; Published online: 10 May 2021 Abstract: In this paper the definitions of Reserved domination number and 2-reserved domination number are introduced as for the graph GVE= ( , ) a subset S of V is called a Reserved Dominating Set (RDS ) of G if (i) R be any nonempty proper subset of S ; (ii) Every vertex in VS− is adjacent to a vertex in S . The dominating set S is called a minimal reserved dominating set if no proper subset of S containing R is a dominating set. The set R is called Reserved set. The minimum cardinality of a reserved dominating set of G is called the reserved domination number of G and is denoted by where is the number of reserved vertices. Using these definitions the 2-reserved domination number for RG(k) − ( ) k Path graph Pn , Cycle graph Cn , Wheel graph Wn , Star graph Sn , Fan graph F1,n , Complete graph Kn and Complete Bipartite graph Kmn, are found. Keywords: Dominating set, Reserved dominating set, 2-Reserved dominating set. 1. Introduction (Times New Roman 10 Bold) Domination in graphs has wide applications to several fields such as mobile Tower installation, School Bus Routing, Computer Communication Networks, Radio Stations, Locating Radar Stations Problem, Nuclear Power Plants Problem, Modeling Biological Networks, Modeling Social Networks, Facility Location Problems, Coding Theory and Multiple Domination Problems with hierarchical overlay networks. Domination arises in facility location problems, where the number of facilities (e.g., Mobile towers, bus stop, primary health center, hospitals, schools, post office, hospitals, fire stations) is fixed and one attempts to minimize the distance that a person needs to travel to get to the nearest facility. A similar problem occurs when the maximum distance to a facility is fixed and government or any service provider attempts to minimize the number of facilities necessary so that everyone is serviced. Concepts from domination also appear in problems involving finding sets of representatives, in monitoring communication or electrical networks, and in land surveying. Let GVE= ( , ) be a graph. A subset S of V is called a dominating set of G if every vertex in VS− is adjacent to a vertex in S . A dominating set S is called a minimal dominating set if no proper subset of S is a dominating set. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by (G) . The maximum cardinality of a minimal dominating set of G is called the upper domination number of G and is denoted by (G) . Consider the situation of installing minimum number of Mobile phone towers so that it will be utilized by all the people living in towns or villages. Here each town or village is considered as separate entity called as vertex. These towns and villages are connected by roads (In this case Ariel distance) called edges. The situation of installing minimum number of Mobile phone Towers is domination problem and this minimum number is domination number. In real life situation it is not always in practice of installing the Towers only at the public utility pattern. If the installing authorities are very much interested in installing the tower, nearer to their residence or nearer to the residence of VIPs or to their favorites’ residence then the concerned person will reserve some of the installation points without any concern about the nearer or proximity of the other towns or villages. Such type installation points are a called reserved installation points. This situation motives the development of the reserved domination points. These reserved points are automatically included in the domination set. 2166 Turkish Journal of Computer and Mathematics Education Vol.12 No.11 (2021), 2166-2181 Research Article 2.Resaserved domination number Definition: Dominating Set Let GVE= ( , ) be a graph. A subset S of V is called a dominating set of G if every vertex in VS\ is adjacent to a vertex in S . A dominating set S is called a minimal dominating set if no proper subset of S is a dominating set. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by (G) . The maximum cardinality of a minimal dominating set of G is called the upper domination number of G and is denoted by (G) . S V G R Definition: Reserved Domination set S VS− S S Let GVE= ( , ) be a graph. A subset of is called a Reserved Dominating Set (RDS ) of if S R R (i) be any nonempty proper subset of . G G (ii) Every vertex ink is adjacent to a vertex in . The dominating set is called a minimal reserved dominating set if no proper subset of containing is a dominating set. The set is called Reserved set. The minimum cardinality of a reserved dominating set of is called the reserved domination number of and is denoted by RG(k) − ( ) where is the number of reserved vertex. Remark: Then , we get the 2-reserved domination number of and is denoted by . In this k = 2 G RG(2) − () paper let us find the 2-reserved domination number of various graphs. Definition: Graph Connected by a Bridge Let G , G be any two graphs and G be a graph attained by connecting G and G by a bridge e= v v 1 2 1 2 12 where v11 V( G ) , v22 V( G ) . 3. Some Preliminaries results Domination Number: n + 2 (i) Lollipop Graph: (Lmn, ) = . 3 mn++21 (ii) Tadpole Graph: (Tmn, ) =+. 33 n (iii) Pan Graph: (Pn,1 ) = . 3 (iv) Barbell Graph: (Bn ) = 2 . Definition: Lollipop Graph The lollipop graph is the graph obtained by joining a complete graph Km with m 3 to a path graph Pn with a bridge. It is denoted by Lmn, . Theorem: For the lollipop graph Lmn, , the reserved domination number is 2167 Turkish Journal of Computer and Mathematics Education Vol.12 No.11 (2021), 2166-2181 Research Article −n 1 1+= , if u1 3 n RL−=, 1+ , if =u, k = 2,3,4,..., m (1) ( mn, ) 3 k k − 3 nk−+( 1) 2+ + , if =vk , k = 1,2,3,..., n 33 Proof: Fig 1: A Lollipop Graph Lmn, . For convenience let us consider the lollipop graph Lmn, into two entities. One is complete graph Km with vertices u1, u 2 , u 3 ,..., um and another one is the path graph P with verticesv1, v 2 , v 3 ,..., vn . n Case (i): Suppose u1 is the reserved vertex. Then u1 must be in the dominating set and dominates the verticesu2, u 3 , u 4 ,..., um v 1 . Now it is enough to find the dominating set for the remaining vertices v23, v ,..., vn . The LVmn,1 with V1= v 2, v 3 ,..., vn is nothing but Pn−1 . Hence R(1) −( Lm, n,1 u 1) = + ( P n− 1 ) n −1 =+1 . 3 Case (ii): Suppose uk , k= 2,3,4,..., m is the reserved vertex. uk Dominates the vertices u1, u 2 ,..., uk−+ 1 , u k 1 ,..., u m and doesn’t dominate the vertices v1, v 2 , v 3 ,..., vn . Since the LVmn,2 with V2= v 1, v 2 , v 3 ,..., vn is Pn , RLP(1) −( m, n,1 ) = + ( n ) n =+1 , where ==uk , k 2,3,..., m . 3 Case (iii): Suppose vk , k= 1,2,3,..., n is the reserved vertex. To dominate the set it is enough to choose anyone of the vertex from that set. But if we choose u1 alone then it would dominate the vertex u23, u ,..., um as well asv1 . So u1 must be in the required dominating set. Since vk is the reserved vertex, it dominates vk−1 and vk+1 . Now the vertices which are not dominated while considering the set vuk , 1 as a subset of the dominating set are U= v2, v 3 ,..., vk−+ 2 , v k 2 ,..., v n . 2168 Turkish Journal of Computer and Mathematics Education Vol.12 No.11 (2021), 2166-2181 Research Article LUPPm,3 n = k− nk−+( 1) . (LUPPm,3 n ) = ( k− ) + ( nk−+( 1) ) Hence R(11) −( Lm, n,, ) = u 1 v k + ( P k− 3 ) + ( Pnk−+( ) ) k −3 nk−+( 1) =2 + + , where . ==vk , k 1,2,3,..., n 33 Definition: Tadpole Graph: The (mn, ) Tadpole graph, also called dragon graph denoted by Tmn, is the graph obtained by joining a cycle graph Cm to a path graph Pn with a bridge. Theorem: For the Tadpole graph Tmn, , the reserved domination number is 2169 Turkish Journal of Computer and Mathematics Education Vol.12 No.11 (2021), 2166-2181 Research Article mn −1 uk ( k=1,2,3,..., m) +=, if 33 v k=−2,3,5,..., n 1, n k ( ) for mn, 0 mod3 ( ) mn−11 + + , if =vk ( k =1,4,7,..., n − 5, n − 2) 33 mn −1 ukk ( =1,4,7,...,mm−−5, 2) +=, if 33 vk ( k=3,6,9,..., n − 4, n − 1) for mn0( mod3) , 1( mod3) mn uk ( k=−2,3,5,..., m 1, m) +=, if 33 v k=−1,2,4,..., n 2, n k ( ) mn uk ( k=1,2,3,..., m) +=, if for mn0( mod3) , 2( mod3) 33 vkk ( =1,2,3,...,n) mn uk ( k=1,2,3,..., m) +, if = for mn 1( mod3) , 0( mod3) 33 vk ( k=1,2,3,..., n) mn −1 uk ( k=1,2,3,..., m) +=, if 33 vkk ( =−1,3,4,...,nn 1, ) RT(1) −=( mn, , ) for mn, 1( mod3) mn +, if =vk ( k =2,5,8,..., n − 5, n − 2) 33 u1, u 2 , u 3 ,..., um Pn v1, v 2 , v 3 ,..., vn mn −1 uk ( k=−1,2,4,..., m 2, m) +=, if 33 vk ( k=−2,3,5,..., n 2, n) for mn1( mod3) , 2( mod3) mn−+11 uk ( k=3,6,9,..., m − 4, m − 1) + , if = 33 v k=1,4,7,..., n − 4, n − 1 k ( ) mn −1 uk ( k=1,2,3,..., m) += , if 33 vk ( k=−2,3,5,..., n 1, n) for mn2( mod3) , 0( mod3) mn−+11 + , if =vk ( k =1,4,7,..., n − 5, n − 2) 33 mn −1 uk ( k=1,3,4,..., m − 2, m − 1) +=, if 33 vk ( k=3,6,9,..., n − 4, n − 1) for m 2 mod3 ,n 1 mod3 ( ) ( ) mn uk ( k=−2,5,8,..., m 3, m) +=, if 33 vk ( k=−1,2,4,..., n 2, n) mn uk ( k=1,2,3,..., m) +, if = for mn, 2(mod3) 33 v k=1,2,3,..., n k ( ) Proof: For convenience let us consider the tadpole graph Tmn, into two entities.
Load more

Recommended publications
  • An Investigation on Some Classes of Super Strongly Perfect Graphs
    Applied Mathematical Sciences, Vol. 7, 2013, no. 65, 3239 - 3246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.34229 An Investigation on Some Classes of Super Strongly Perfect Graphs R. Mary Jeya Jothi Department of Mathematics Sathyabama University, Chennai Tamilnadu, India A. Amutha Department of Mathematics Sathyabama University, Chennai Tamilnadu, India. Copyright ©2013 R. Mary Jeya Jothi and A. Amutha. This is an open access article 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 A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. Bipartite graphs, Complete graphs etc., are some of the most important classes of Super Strongly Perfect graphs. Here, we summarize the results concerning Super Strongly Perfect graphs. We investigate some classes of Super Strongly Perfect graphs and we investigate the structure of Super Strongly Perfect Graphs. Keywords : Super Strongly Perfect Graph, maximal complete sub graph, minimal dominating set 1. Introduction In this paper, graphs are finite, undirected and simple, that is, they have no loops or multiple edges. Let G be a graph. A Complete graph is a simple undirected graph in which every pair of distinct vertices is connected by 3240 R. Mary Jeya Jothi and A. Amutha a unique edge. The complete graph on n vertices is denoted by Kn. A Path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence.
    [Show full text]
  • DOMINATOR CHROMATIC NUMBER of SOME GRAPHS the Dominator
    International Journal of Pure and Applied Mathematics Volume 119 No. 7 2018, 787-795 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu Special Issue ijpam.eu DOMINATOR CHROMATIC NUMBER OF SOME GRAPHS T.Manjula1 and R.Rajeswari2 1Research Scholar Sathyabama University Chennai, India 2Professor Department of Mathematics Sathyabama University Chennai, India ABSTRACT The dominator coloring of a graph G is defined as a proper coloring of G where each vertex of the graph dominates every vertex of atleast one color class. The dominator chromatic number is the least number of color classes used in a dominator coloring of a graph G.Thedominator chromatic number and domination number ofdragon graph andlollipop graph are obtained and a relationship between the chromatic number, domination number and dominator chromatic number is expressed in this paper. Keywords: Coloring, Domination, Dominator coloring, Dragon graph, Lollipop graph 1. INTRODUCTION Let G be a graph with vertex set V and edge set E. A dominating set S is a subset of the vertex set V such that every vertexin the graph either belongs to S or has a neighbor in S. If no proper subset of S is a dominating set, thenS is called a minimum dominating set. The domination number denoted by γ(G) is the order of a minimum dominating set. Dominating sets are useful in routing problems, scheduling problems, assignment problems, computer communication networks, land surveying, assignment problems, coding theory etc.. A proper vertex coloring of a graph G is allocation of colors to the vertices such that two neighboring vertices belong to the different color class.
    [Show full text]
  • (1,2)-Pitchfork Domination and Its Inverse on Some Special Graphs
    Bol. Soc. Paran. Mat. (3s.) v. ???? (??) : 1–8. c SPM –ISSN-2175-1188 on line ISSN-0037-8712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.52252 Applying the (1,2)-Pitchfork Domination and Its Inverse on Some Special Graphs Mohammed A. Abdlhusein abstract: Let G be a finite graph, simple, undirected and with no isolated vertex. For any non-negative integers j and k, a dominating set D of V (G) is called a pitchfork dominating set of G if every vertex in it dominates j vertices (at least) and k vertices (at most) from V − D. A set D−1 of V − D is an inverse pitchfork dominating set if it is pitchfork dominating set. In this paper, pitchfork domination and inverse pitchfork domination are applied when j = 1 and k = 2 on some special graphs such as: tadpole graph, lollipop graph, lollipop flower graph , daisy graph and Barbell graph. Key Words: Dominating set, Inverse dominating set, Pitchfork domination, Inverse pitchfork dom- ination. Contents 1 Introduction 1 2 Pitchfork Domination 2 3 Inverse Pitchfork Domination 4 4 Acknowledgement 7 1. Introduction Let G be a graph with no isolated vertex has a vertex set V of order n and an edge set E of size m. The number of edges incident on vertex w is denoted by deg(w) and represent the degree of w. A vertex of degree 0 is called isolated and a vertex of degree 1 is a leaf. The vertex that adjacent with a leaf is a support vertex. The minimum and maximum degrees of vertices in G are denoted by δ(G) and ∆(G), respectively.
    [Show full text]
  • Embedding Index in Some Classes of Graphs
    Notes on Number Theory and Discrete Mathematics ISSN 1310-5132 Vol. 21, 2015, No. 2, 80–88 Embedding index in some classes of graphs M. Kamal Kumar1 and R. Murali2 1 Department of the Mathematics, CMR Institute of Technology Bangalore 560037, India e-mails: [email protected] 2 Department of the Mathematics, Dr. Ambedkar Institute of Technology Bangalore, India e-mail: [email protected] Abstract: A Subset S of the vertex set of a graph G is called a dominating set of G if each vertex of G is either in S or adjacent to at least one vertex in S. A partition D = {D1, D2, …, Dk} of the vertex set of G is said to be a domatic partition or simply a d-partition of G if each class Di of D is a dominating set in G. The maximum cardinality taken over all d-partitions of G is called the domatic number of G denoted by d (G). A graph G is said to be domatically critical or d-critical if for every edge x in G, d (G – x) < d (G), otherwise G is said to be domatically non d-critical. The embedding index of a non d-critical graph G is defined to be the smallest order of a d-critical graph H containing G as an induced subgraph denoted by θ (G) . In this paper, we find the θ (G) for the Barbell graph, the Lollipop graph and the Tadpole graph. Keywords: Domination number, Domatic partition, Domatic number, d-Critical graphs. AMS Classification: 05C69. 1 Introduction A subset S of the vertex set of a graph G is called a dominating set of G if each vertex of G is either in S or adjacent to at least one vertex in S.
    [Show full text]
  • Connected Total Domination Polynomials of Graphs
    International Journal of Mathematical Archive-5(11), 2014, 127-136 Available online through www.ijma.info ISSN 2229 – 5046 CONNECTED TOTAL DOMINATION POLYNOMIALS OF GRAPHS A. Vijayan1 and T. Anitha Baby*2 1Associate Professor, Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamil Nadu, India. 2Assistant Professor, Department of Mathematics, V. M. C. S. I. Polytechnic College, Viricode, Marthandam, Tamil Nadu, India. (Received On: 18-11-14; Revised & Accepted On: 30-11-14) ABSTRACT In this paper, we introduce the concept of connected total domination polynomial for any graph G. The n i connected total domination polynomial of a graph G of order n is the polynomial Dct (Gx, ) = ∑ dct (G, i)x , i = γ ct (G) where dct(G, i) is the number of connected total dominating sets of G of size i and γct(G) is the connected total domination number of G. We obtain some properties of Dct(G, x) and its coefficients. Also, we calculate the total domination polynomials for the complete graph Kn, the complete bipartite graph Km,n, the bi-star Bm,n, the Barbell graph Bn, the Lollipop graph Ln,1 and the Tadpole graph Tn,1. Key words: Connected total dominating sets, connected total domination number, connected total domination polynomial. 1. INTRODUCTION Let G = (V, E) be a simple connected graph of order n. For any vertex v∈V, the open neighbourhood of v is the set N(v)={u∈V/uv∈E} and the closed neighbourhood of v is the set N[v] = N(v)∪{v}. For a set S⊆V, the open neighbourhood of S is NS( ) = N(v) and the closed neighbourhood of S is N[S] = N(S) ∪ S.
    [Show full text]