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

• Published in: Journal of physics. Conference series Vol. 1724; no. 1; pp. 12018 - 12026
• Main Authors: Anuthiya, S., Mahadeven, G.
• Format: Journal Article
• Language: English
• 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

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...