Restrained triple connected outer perfect domination number for derived graphs

A. Iravithul Basira [6] introduced the concept of restrained triple connected outer perfect domination number of a graph. A restrained dominating set S is said to be a restrained triple connected outer perfect dominating set, if < S > is a triple connected dominating set and < V – S > ha...

Full description

Saved in:
Bibliographic Details
Main Authors: Mahadevan, G., Priya, K., Sivagnanam, C.
Format: Conference Proceeding
Language:English
Subjects:
Graphs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A. Iravithul Basira [6] introduced the concept of restrained triple connected outer perfect domination number of a graph. A restrained dominating set S is said to be a restrained triple connected outer perfect dominating set, if < S > is a triple connected dominating set and < V – S > has a perfect matching. The minimum cardinality of a restrained triple connected outer perfect dominating set (rtopd-set) is called restrained triple connected outer perfect domination number (rtopd-number) and is denoted by Yrtopd(G) In this paper we investigate this parameter for some special types of graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0211775