Keywords:-
Article Content:-
Abstract
In 1977,E.J.Cockayne and S.T. Hedetniemi conducted a commendable and broad survey on the outcomes of the existing concepts of dominating set in graphs. It’s basic concept is the dominating set and the domination number. In this paper our main aim is to find out the dominating parameters of Bipartite graph obtained on the Commutative ring of type Zn. A subset D of V is said to be a dominating set of G if every vertex in V-D is adjacent to a vertex in D. A bipartite graph is a graph G whose vertex set is partitioned into two disjoint subsets X and Y such that each edge in G has one end in X and the other end in Y. We determine the domination parameters i.e., domination number, dominating set and Minimum domination number of Bipartite graphs of the commutative ring Zn.
References:-
References
Bhattacharya P.B, Jain.S.k, Nagpul “Basic Abstract Algebra”, Plika Press Pvt. Lt Red, New Delhi-2007.
Grimaldi R.P. “Graphs from rings”. Proceedings of the 20th South-eastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989). Congv. Numer. Vol. 71, pp. (1990) 95-103.
Chartrand G., Oellermann, O.R “Applied and Algorithmic Graph Theory”. New York: McGraw-Hill, Inc. (1993).
Frank Harary “Graph theory”, Narosa publishing house, New Delhi 2001, ISBN-978-81-85015-55-2.
Ore.O. “Theory of Graph”, Ann.Math.Sco. Colloq.Publ.38, providence, 1962.
Berge.C Holland, “Graphs and Hyperactive Graphs”, North Holland, amsterdram in Graps, Networks, Vol. 10 (1980), 211-215.
Haynes.T.w, Hedetniemi.S.T. and Slater.P.S, “Fundementals of domination in graphs”, Marcel Dekker,Inc,.New York(1998).
Haynes.T.W, Hedetniemi.S.T and Slater.P.S, “Domination in Graphs: advanced topic” Marcel dekker.Inc.,New York (1998).