Abstract
A set S⊆ V(G) said to be an at most twin outer perfect dominating set if for every vertex v∈V-S, l⩽|N(v)∩S|⩽2 and < V-S> has at least one perfect matching. The minimum cardinality of at most twin outer perfect dominating set is called the at most twin outer perfect domination number and γ atop (G) denotes this number. This was initiated by G.Mahadevan.et.al., recently. Here we find this number for general Binary-tree. corona product of paths and cycles and lotus inside graph.
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
