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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
