EXACT VALUES OF THE ATES-DOMINATION NUMBER OF SOME SPECIALIZED TYPES OF GRAPHS. Issue 1 (May 2021)

• Record Type: Journal Article
• Authors: Anuthiya, S.; Mahadevan, G.
• Is Part Of: Journal of physics. Volume 1850:Issue 1(2021)
• Publication Date: 2021-05
• Subjects: ATES -- Perfect matching -- complementary perfect matching.; 05C69.; Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1850/1/012124
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: Recently, G. Mahadevan et.al. proposed the idea of ATES domination number of a graph. In [6] A set S ⊆ V is said to be At most twin extendable separated dominating set, if for every vertex 1 ≤ | N ( V ) ∩ S | ≤ 2, v ∊ V − S and < V − S > is a perfect matching. The minimum cardinality taken over all At most twin extendable separated dominating sets is called At most twin extendable separated domination number of a graph and it is denoted by ATES (G). In this article, we analyze this number for some specializes types of graphs.