IOSR Journal of Mathematics (IOSRJM) ISSN: 2278-5728 Volume 2, Issue 6 (Sep-Oct. 2012), PP 14-18 www.iosrjournals.

org

Some Domination Parameters of Arithmetic Graph Vn

S.Uma Maheswari 1and B.Maheswari2
1.Lecturer in Mathematics, J.M.J.College, Tenali,Andhra Pradesh,India. 2.Department of Applied Mathematics, S.P.Womens University,Tirupati,Andhra Pradesh, India.

Abstract: Number Theory is one of the oldest branches of mathematics, which inherited rich contributions
from almost all greatest mathematicians, ancient and modern. Nathanson [1] was the pioneer in introducing the concepts of Number Theory, particularly, the Theory of Congruences in Graph Theory, thus paving way for the emergence of a new class of graphs, namely Arithmetic Graphs. Inspired by the interplay between Number Theory and Graph Theory several researchers in recent times are carrying out extensive studies on various Arithmetic graphs in which adjacency between vertices is defined through various arithmetic functions. Keywords: Arithmetic graph, Domination, Total domination, Independent domination, Connected domination. I. Arithmetic graph and its properties Vasumathi [2] introduced the concept of Arithmetic graphs and studied some of its properties. Their definition of Arithmetic graph is as follows. Let be a positive integer such that = 1 1 2 2 . . . Then the Arithmetic graph is defined as the graph whose vertex set consists of the divisors of and two vertices , are adjacent in graph if and only if GCD (, ) = , for some prime divisor of . In this graph vertex 1 becomes an isolated vertex. Hence we consider Arithmetic graph without vertex 1 as the contribution of this isolated vertex is nothing when domination parameters are studied. Clearly, graph is a connected graph. If is a prime, then graph consists of a single vertex. Hence it is connected. In other cases, by the definition of adjacency in , there exist edges between prime number vertices and their prime power vertices and also to their prime product vertices. Therefore each vertex of is connected to some vertex in . In this paper we discuss various domination parameters of Arithmetic graph. While studying several properties of Arithmetic graph, it is observed that the domination parameters like domination number, total domination number, independent domination number and connected domination number of these graphs are functions of , where is the core of , that is the number of distinct prime divisors of . Let denote the graph throughout this paper.

II.

Domination in Arithmetic graph

The concept of domination in graph theory was formalized by Berge [3] and Ore [4] and is strengthened by Haynes, Hedetniemi, Slater [5, 6] who presented a survey articles in the wide field of domination in graphs. Domination in graphs has been studied extensively and at present it is an emerging area of research in graph theory. Let G(V,E) be a graph. A subset of is said to be a dominating set of if every vertex in is adjacent to a vertex in . The minimum cardinality of a dominating set is called the domination number of and is denoted by . In this section we find minimum dominating sets of graph and obtain their domination numbers in various cases. Theorem 1: If = 1 1 2 2 . . , where 1 , 2 , are primes and 1 , 2 , . are integers 1, then the domination number of is given by 1 if i = 1 for more than one i = Otherwise. where is the core of . Proof: Let = 1 1 2 2 . . . Then we have the following possibilities. Case 1: Suppose i > 1 for all . Then we show that the set = 1 , 2 , . . , becomes a dominating set of . By the definition of graph, it is obvious that the vertices in are primes 1 , 2 , . . , , their powers and their products. Let V be the vertex set of GCD , 1 = . All the vertices , for which 1 are adjacent to the vertex 1 in . All the vertices , for which GCD , 2 = 2 are adjacent to the vertex 2 in . Continuing in this way we obtain that all the vertices , for www.iosrjournals.org 14 | P a g e

Some Domination Parameters Of Arithmetic Graph Vn

which GCD , = are adjacent to the vertex in . Since every vertex in has atleast one prime factor viz., 1 , 2 , . . , ( as they are divisors of ) every vertex in is adjacent to at least one vertex in . Thus becomes a dominating set of . We now prove that is minimum. Suppose we remove any from . Then the vertices of the form , > 1 will be non-adjacent to any other vertex as GCD , = 1 for . Therefore every , = 1, 2, . . , must be included into . If we form a minimum dominating set in any other manner, then the order of such a set is not smaller than that of . This follows from the properties of prime divisors of a number. Hence = = . Case 2: Suppose i = 1 for only one . That is, is the only prime divisor of with exponent 1. Then 1 +1 = 1 1 . 2 2 . . 1 . . +1 . . . . Now the primes 1 , 2 , . , 1 , +1 , , are to be included into a dominating set of as proved in Case 1. But the vertex will not be adjacent to any other vertex in . Therefore is also to be included into D. Thus the set 1 , 2 , . . , forms a minimum dominating set of . Hence = . Case 3: Suppose i = 1 for more than one . Denote the prime divisors of with exponent 1 by +1 1 , 2 , . . , and write = 1 . 2 . . +1 . . . . Let = 1 , 2 , . . , 2 , 1 , , +1 . , . Then we show that forms a minimum +1 dominating set of Any vertex in will be of the form 1 1 . 2 2 . . . +1 . . . where . 1 , 2 , . . , 1, and for = + 1, + 2, . . , . Then clearly is a dominating set as every vertex in is adjacent to at least one vertex in . However this is not a minimum dominating set. Let = 1 , 2 , . . , 2 , 1 . , +1 , . , where the vertices 1 , are adjacent to the vertex 1 . . This is clearly a minimum dominating set of For, any deletion of vertices in this . set will not make it a dominating set any more. Hence = = 1.

III.

Total Domination in Arithmetic graph

Total dominating sets are introduced by Cockayane, Dawes and Hedetniemi [7]. Some results regarding total domination can be seen in [ 8 ]. Let ( , ) be a graph without isolated vertices. Then a total dominating set is a subset of V such that every vertex of is adjacent to some vertex in . The minimum cardinality of a total dominating set of is called the total domination number of and is denoted by . In this section we discuss about the total domination of and obtain its total domination number. Theorem 2 : Let = 1 1 2 2 . . where i 1, . Then the total domination number of is , where is the core of . Proof: Let = 1 1 2 2 . . where i 1, . Let = 1 , 2 , . . , 1 , where = 1 2 . . , the product of distinct prime divisors of , which is a vertex in . We now show that is a minimum total dominating set of Case 1 of . As in the proof of Theorem 1, we see that a vertex for which GCD , = is adjacent to the vertex in for = 1, 2, . , 1. Now the vertex and the vertices which are powers of are adjacent to the vertex = 1 2 . . , as GCD , = for = 1, 2, . , . Also the vertices 1 , 2 , . . , 1 are adjacent to vertex respectively. Thus forms a total dominating set of . We next prove that is minimum. Suppose we remove any vertex from . Then the vertices of the form are not adjacent to any vertex in . That is is not a dominating set, a contradiction. Further if we form a minimum total dominating set in any other manner, by the properties of prime numbers, the order of such a set is not smaller than that of . Thus the total domination number of is . That is = = . IV. Independent Domination in Arithmetic graph Independent domination was introduced by R.B.Allan and R.C.Laskar [9]. We determine minimum independent dominating sets and independent domination number of graph as follows. A dominating set of a graph G in which no two vertices are adjacent is called an independent dominating set of . The induced subgraph is a null graph if is an independent dominating set. The minimum cardinality of an independent dominating set of is called the independent domination number of and is denoted by . www.iosrjournals.org 15 | P a g e

Some Domination Parameters Of Arithmetic Graph Vn

Theorem 3: If = where 1 , 2 , are primes and 1 , 2 , . are integers 1, then the independent domination number of is given by 1 if i = 1 for more than one i = Otherwise where is the core of . Proof: Suppose = 1 1 2 2 . . . We have the following cases. Case 1: Suppose i > 1, i or i = 1 for only one . Let = 1 , 2 , . . , . Then as proved in Case 1 and Case 2 of Theorem 1, with cardinality becomes a minimum dominating set of . Now any two vertices , in for are not adjacent to each other because GCD , = 1 for . Hence becomes an independent dominating set of with minimum cardinality. Hence == = . Case 2: Suppose i = 1 for more than one i. Let 1 , 2 , . . , are the prime divisors of with +1 exponent 1 and writing these primes in ascending order, we have = 1 . 2 . . +1 . . . . Then recall a dominating set with minimum cardinality 1 defined as in case 3 of Theorem 1. Let = 1 , 2 , . . , 2 , 1 . , +1 . , . As in case 1, no two vertices in are adjacent to each other because for , GCD , = 1. Therefore becomes an independent dominating set of , with minimum cardinality. Hence == = 1.
1 1 2 2 . . ,

V.

Connected Domination in Arithmetic graph

Sampathkumar, E. and Walikar,H.B. [10] introduced the concept of connected domination in graphs. For a survey of connected domination see [11]. It is easy to observe that only connected grapgs have a connected dominating set. A dominating set of a graph is said to be a connected dominating set if the induced subgraph is connected. The minimum cardinality of a connected dominating set of is called the connected domination number of and is denoted by . We now study connected dominating sets of graph and obtain connected domination number in various cases as follows. Theorem 4: If is power of a prime, then the connected domination number of is 1. Proof: Suppose = p, where is any prime. Let V be the vertex set of given by V = graph p, p2 , p3 . . , p . Now GCD , = , for all > 1, implies that vertex is adjacent to the remaining vertices p2 , p3 . . , p . Hence if = then becomes a dominating set of . Therefore = = 1. Obviously the induced subgraph is connected. Hence becomes a connected dominating set of with minimum cardinality. Hence = 1. Theorem 5: If is the product of two distinct primes, then the connected domination number of is 1. Proof: Suppose = p1 p2 where p1 and p2 are two distinct primes. Then the graph contains three vertices viz., p1 , p2 and p1 p2 . Since GCD p1 , p1 p2 = p1 and GCD p2 , p1 p2 = p2 , it follows that vertex p1 p2 is adjacent to both the vertices p1 and p2 . Hence if = p1 p2 , then becomes a dominating set of . Therefore = 1. Obviously the induced subgraph is connected. Hence becomes a connected dominating set of with minimum cardinality. Hence = 1. Theorem 6 : If is neither a prime nor a prime power nor product of two distinct primes, then the connected domination number of is k where is the core of . Proof: Let = 1 1 2 2 . . , where 1. To get a connected dominating set of , we proceed as follows. Let = 1 , 2 , . . , 1 , where = 1 2 . . , the product of distinct prime divisors of , which is a vertex in . As proved in Theorem 2 , is a minimum dominating set of . Also the vertices 1 , 2 , . . , 1 are adjacent to the vertex respectively, as GCD , = , for = 1, 2, , 1. Thus all the vertices in are adjacent to each other. Hence becomes a minimum connected dominating set of . Therefore = = . www.iosrjournals.org 16 | P a g e

VI.

Some Domination Parameters Of Arithmetic Graph Vn Illustrations

G (V60)

G (V100)

G (V180)

Minimum Dominating Set Minimum Total Dominating Set Minimum

= = {2,15} 2 {2,3,30} 3 {2,15}

G (V210) = = {2,5} 2 {2,10} 2 {2,5}

= = {2,3,5} 3 {2,3,30} 3 {2,3,5}

= = {2,3,35} 3 {2,3,5,210} 4 {2,3,35} 17 | P a g e

www.iosrjournals.org

Some Domination Parameters Of Arithmetic Graph Vn

Independent Dominating Set Minimum Connected Dominating Set

2 {2,3,30} 3

2 {2,10} 2

3 {2,3,30} 3

3 {2,3,5,210} 4

References
[1]. [2]. [3]. [4]. [5]. [6]. [7]. [8]. [9]. [10]. [11]. Nathanson, Melvyn B. - Connected components of arithmetic graphs, Monat. fur. Math, 29, 1980. 219 220. Vasumathi, N. - Number theoretic graphs, Ph. D. Thesis, S.V.University, Tirupati, India, 1994. Berge, C. - The Theory of Graphs and its Applications ,( Methuen, London) , 1962. Ore, O. - Theory of Graphs, Amer. Math. Soc. Colloq. Publ., 38 , Providence, 1962. Haynes, T. W., Hedetniemi, S.T., Slater, P.J. - Domination in graphs: Advanced Topics ( Marcel Dekker, Inc., New York), 1998. Haynes, T.W., Hedetniemi, S.T., Slater, P.J. - Fundamentals of domination in graphs (Marcel Dekker, Inc., New York) , 1998. Cockayne, C.J. , Dawes, R.M., Hedetniemi, S.T. - Total domination in graphs, Networks, 10, 1980, 211-219. Allan, R.B., Laskar, R.C., Hedetniemi, S.T. - A note on total domination, Discrete Math. 49, 1984, 7-13 . Allan, R.B, Laskar, R.C. - On domination and independent domination numbers of a graph, Discrete Math, 23, 1978, 73-76. Sampathkumar, E., Walikar, H.B. - The connected domination number of a graph, Math.Phys. Sci.,13, 1979, 607-613. Hedetniemi, S.T., Laskar, R.C., - Connected domination in graphs, Graph Theory and Combinatorics (Academic Press, London, 1984).

www.iosrjournals.org

18 | P a g e