Open AccessTwin Paired Domination number of a graph
Author(s) -
G. Mahadevan,
M. Vimala Suganthi
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1543/1/012012
Subject(s) - algorithm , graph , domination analysis , computer science , mathematics , combinatorics , vertex (graph theory)
A new domination papramter “Twin paired domination number” is introduced in this paper. The set S ⊆ V is called as be twin paired dominating set, if S is a paired dominating set and < S c > has a perfect matching. The minimum cardinality over all S is called as twin paired domination number and it is denoted by TPD ( G ). In this paper, we investigate this parameter for some standard, special type graphs and for some power graphs.