Restrained step triple connected domination number of a graph. (4th July 2019)

• Record Type: Journal Article
• Authors: Mahadevan, G.; Suganthi, M. Vimala; Basira, A. Iravithul
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 5(2019)
• Page Start: 731
• Page End: 744
• Publication Date: 2019-07-04
• Subjects: 05C69; Restrained domination number -- restrained step domination number -- triple connected domination number; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1681690
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: In this paper, we introduce the new parameter called restrained step triple connected domination number of a graph. A set S ⊆ V of a graph G is said to be restrained step triple connected dominating set, if < S > is the restrained triple connected dominating set and < V – S > is a perfect matching. The minimum cardinality taken over all the restrained step triple connected dominating sets is called the restrained step triple connected domination number of G and is denoted by γrstc ( G ). In this paper we investigate this parameter for some standard classes of graphs, special types of graphs, and some product related graphs.