Abstract

– The Domination theory is an important branch of Graph theory that has wide range of applications to various branches of Science and Technology. A subset D of the vertex set V of the graph G (V, E) is said to be a Dominating set if every vertex in V-D is dominated by at least one vertex of D. A dominating set D in which no two vertices of it are adjacent is called an Independent Dominating Set. In this paper, we determine the Independent dominating set, domination number and some results on domination for the graph of Mobius function for ‘0’, 𝐺 𝜇𝑛 (0) , which has the vertex set as the set of first n natural numbers and any two vertices a, b are adjacent if the value of Mobius function 𝜇 𝑎𝑏 = 0.

Keywords

References

[1] Anderson D. F., Badawi A, “The total graph of commutative ring”, J.Algebra, 320, 2706-2719, 2008.
[2] Berge. C, “Theory of Graphs and its Applications”, Methuan publications, London, 1962.
[3] Bharathi D., Shaik Sajana, “Some properties of the intersection graph for finite Commutative Rings”, International Journal of Scientific and Innovative Mathematical Research Volume 3, Special Issue 3, July 2015, PP 1062-1066.
[4] Bondy J. A. and Murthy. U. S. R, “Graph Theory with Applications”, Macmillan, London, 1976.
[5] Cadogan C. C., “The Mobius function and connected graphs”, Journal of Combinatorial Theory, 11, 193-200, 1971.
[6] Chalapathi T, Madhavi L, “Enumeration of Triangles in a Divisor Cayley Graph”, Momona Ethiopian Journal of Science (MEJS), Volume 5(1):163-173, 2013.
[7] Cockayne. E. J and Hedetniemi. S. T, “Towards a theory of Domination in Graphs”, Networks, 7 (3), 1977, 247-261.
[8] Douglas B. West, “Introduction to Graph Theory”, second edition, Prentice Hall of India, 2003.
[9] Eswara Rao D., Bharathi D., “Total Graphs of Idealization”, International Journal of Computer Applications (0975 – 8887) Volume 87 – No.15, February 2014.
[10] Hedetniemi S. T., and R. C. Laskar, “Bibliography on Domination in graphs and some basic Definitions of Domination parameters”, Discrete Mathematics 86 (1990) 257-277.
[11] Melvyn B. Nathanson, “Methods in Number Theory”, Springer – Verlag New York, Inc., 2006.
[12] Narsingh Deo, “Graph theory with Applications to Engineering and Computer Science”, Prentice Hall Inc., U. S. A., 2000.
[13] Nathanson Melvyn. B, “Connected components of Arithmetic Graphs”, Monatshefte fur Mathematik, 89 (1980), 219-222.
[14] Ore. O, “Theory of Graphs”, American Mathematical Society Colloquium publications, 1962.
[15] Robert B. Allan and Renu Laskar, “On Domination and Independent Domination of a Graph”, Discrete Mathematics, 23 (1978), 73- 76.
[16] Srimitra K. K., Shaik Sajana, Bharathi D., “Adjacency and Degree of Graph of Mobius function”, i – Manager‟s Journal on Mathematics, Vol. 5, No. 1, January – March, 2016, pp 31 – 38.
[17] Srimitra K. K., Shaik Sajana, Bharathi D., “Some Properties of Graph of Mobius Function for „0‟”, International Journal of Innovative Research in Science, Engineering and Technology, Vol. 6, Issue 8, Aug, 2017, pp 17466 – 17471.
[18] Tom M. Apostol, “Introduction to Analytic Number theory”, Narosa publishing house, 1998.
[19] Vasumathi. N, 1994, “Graphs on Numbers”, Ph.D. Thesis, Sri Venkateswara University, Tirupati, India.