Open AccessDouble Twin Domination Number Of Peculiar Graphs
Author(s) -
G. Mahadeven,
S. Anuthiya
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/012003
Subject(s) - algorithm , computer science
G. Mahadevan, et, al., introduced the concept of Double Twin Domination number of a graph. DTwin ( u, v ) is sum of number of a u − v paths of length less than or equal to four. The total number of vertices that dominates every pair of vertices SDTwin ( G ) = ∑ D T w i n ( u , v ) for u , v ∈ V ( G ) The double twin domination number of G is defined as D T D ( G ) = S D T w i n ( G ) ( n 2 ) . In this paper we explore this parameter for Pan, Helm, Triangular Snake, related graphs.