Open AccessSome More Results on at Most Twin Extendable Separated Domination Number of a Graphs
Author(s) -
S. Anuthiya,
G. Mahadeven
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/1724/1/012018
Subject(s) - combinatorics , dominating set , mathematics , vertex (graph theory) , graph , domination analysis , discrete mathematics
Previously, G. Mahadevan et. al., has invented the concept of At most twin Extendable separate Domination number of a graph and obtained many resluts. A set S ⊆ V is said to be At most twin extendable separated dominating set, if for every vertex υ ∈ V − S , 1 ⩽ | N ( V ) ∩ S | ⩽ 2 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 research paper, this number is evaluated for some intersting special types of graphs.