Clone hop domination number of a graph. (4th July 2019)

• Record Type: Journal Article
• Authors: Mahadevan, G.; Vijayalakshmi, V.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 5(2019)
• Page Start: 719
• Page End: 729
• Publication Date: 2019-07-04
• Subjects: 05C69; Clone hop dominating set -- hop dominating set; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1681689
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: In this paper we introduce the concept of clone hop domination number of a graph. A set S ⊆ V is a hop dominating set of G, if for every vertex u ∈ V – S, there exists u ∈ S such that d ( u, v ) = 2. A set S ⊆ V is a clone hop dominating set of G, if S is a hop dominating set and has a perfect matching. The minimum cardinality of clone hop dominating set is called clone hop domination number of G and it is denoted by CHD(G). In this paper we initiate this paramter and discuss various interesting results.