Open AccessCITD-number for some graph operations
Author(s) -
M. Vimala Suganthi,
G. Mahadeven
Publication year - 2021
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/1724/1/012019
Subject(s) - dominating set , combinatorics , mathematics , graph , independent set , set (abstract data type) , cardinality (data modeling) , domination analysis , discrete mathematics , computer science , data mining , vertex (graph theory) , programming language
G. Mahadevan. et. al. initiated the concept of CITD-number. The set S ⊆ V is said to be Complementary independent twin paired dominating set, if S is a paired dominating set and is a set of independent edges. The minimum cardinality taken over all the Complementary independent twin paired dominating set is called as Complementary independent twin paired domination number and it is denoted by CITD(G). We investigate this parameter for some graph operations.