Open AccessBlast Domination Number of Transformation Graphs of Linear and Circular Graphs
Author(s) -
A. Ahila
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1037.1284s419
Subject(s) - dominating set , combinatorics , mathematics , indifference graph , maximal independent set , clique sum , cograph , chordal graph , pathwidth , discrete mathematics , trapezoid graph , split graph , connected dominating set , 1 planar graph , graph , line graph , vertex (graph theory)
A subset S of V of a non-trivial connected graph G is called a Blast dominating set (BD-set), if S is a connected dominating set and the induced sub graph − is triple connected. The minimum cardinality taken over all such Blast Dominating sets is called the Blast Domination Number (BDN) of G and is denoted as, (). In this article, let us mull over the generalized transformation graphs and get hold of the analogous lexis of the Blast domination numbers for all the rage, transformation graphs, and their complement graphs, for linear and circular graphs.