EXPLORING AT MOST TWIN OUTER PERFECT DOMINATION NUMBER FOR GENERAL BINARY TREE AND SOME SPECIAL GRAPHS. Issue 1 (May 2021)

• Record Type: Journal Article
• Authors: Mahadevan, G.; Iravithul Basira, A.; Vimala Suganthi, M.
• Is Part Of: Journal of physics. Volume 1850:Issue 1(2021)
• Publication Date: 2021-05
• Subjects: Complementary perfect domination number -- at most twin outer perfect domination number; 05C69; Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1850/1/012034
• Languages: English
• ISSNs: 1742-6588

Abstract

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.