Communication network analysis using blast domination in sunlet line graphs

Abstract

A variety of connectedness has been studied in the literature by considering the existence of a path between any two vertices. A communication network in which a communicating node can send a message to two stations at one stretch will be more effective and economic. Such an optimization leads to the concept of triple connected graphs. The cardinality number noted over all Blast Dominating sets is denoted as the blast domination number. A Blast Domination set is said to be a graph $V$ with $n$ number of subsets if $n$ is a dominating set. Here, pendants over different phases are discussed for the Blast Domination number in the line graph of an undirected graph $H$. The notation for the minimum cardinality of the dominating set in $H$ is called the Blast Domination number, denoted $\alpha(H)$. In this paper, the Blast Domination number for the line graph of $n$-Sunlet graphs is determined.