Open AccessEXACT VALUES OF THE ATES-DOMINATION NUMBER OF SOME SPECIALIZED TYPES OF GRAPHS
Author(s) -
S. Anuthiya,
G. Mahadevan
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1850/1/012124
Subject(s) - combinatorics , mathematics , dominating set , domination analysis , graph , vertex (graph theory) , cardinality (data modeling) , discrete mathematics , computer science , data mining
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 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.