Loading

Blast Domination Number of Transformation Graphs of Linear and Circular Graphs
A. Ahila

A. Ahila, Department of Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
Manuscript received on 07 January 2020 | Revised Manuscript received on 29 January 2020 | Manuscript Published on 04 February 2020 | PP: 93-96 | Volume-8 Issue-4S4 December 2019 | Retrieval Number: D10371284S419/2019©BEIESP | DOI: 10.35940/ijrte.D1037.1284S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: 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.
Keywords: Blast Domination Number of A Graph, Triple Connected Domination Number, Triple Connected Graph.
Scope of the Article: Cryptography and Applied Mathematics