18Unit Graphs having their Domination Number half their Order
Amit Kumar
Banasthali Vidyapith,Banasthali, Rajasthan (INDIA)E-mail: amitsu48@gmail.com
Pranjali
University of Rajasthan,Jaipur, Rajasthan (INDIA)E-mail: pranjali48@gmail.com
Mukti Acharya
Christ University,Bengaluru (INDIA)E-mail: pranjali48@gmail.com
Pooja Sharma
Banasthali vidyapith,Banasthali, Rajasthan (INDIA)E-mail: sapooja1984@gmail.com
In this chapter, we characterize the rings for which the extrema in the inequality 1 ≤ γ(G(R)) ≤ n holds, where γ is the domination number of unit graph G(R). In the sequel, we determine the rings, whose unit graph has unique minimum dominating set. Further, we have considered the problem of characterizing the rings for which G(R) has either ...
Get Recent Advancements in Graph Theory now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.