Abstract
A dominating set D of any graph G (simple and connected) is a set in which each vertex in V-D is adjacent to atleast one vertex in D. The number of vertices in the dominating set with minimum cardinality is called domination number and it is denoted as γ (G). In this paper we have obtained paired domination number for some simple graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
