Some More Results on at Most Twin Extendable Separated Domination Number of a Graphs

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 < V − S > i...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1724; no. 1; pp. 12018 - 12026
Main Authors Anuthiya, S., Mahadeven, G.
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.01.2021
Subjects
[1, 2]-domination set
AMS Subject classification: 05C69
At most twin extendable separated domination number
Complementary perfect matching
Graphs
Physics
Scientific papers
Online AccessGet full text

Cover

More Information
Summary: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 < 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 research paper, this number is evaluated for some intersting special types of graphs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1724/1/012018