Pursuit Over Detaching Threshold on Blast Domination Number of Graphs

Ahila, A. (2023) Pursuit Over Detaching Threshold on Blast Domination Number of Graphs. In: Research and Applications Towards Mathematics and Computer Science Vol. 7. B P International, pp. 117-124. ISBN 978-81-968463-4-3

Full text not available from this repository.

Abstract

Provoked by scores of triple connected domination parameters, recently the concept of Blast Domination Number was introduced by A. Ahila et.al., which got its delicate applications in blasting mines, quarries, and sensor areas. A subset of of a non-trivial connected graph G is called a Blast dominating set (or) BD-set, if is a connected dominating set and the induced sub graph (V-S) is triple connected. The least cardinality taken over all such Blast Dominating sets is called the Blast Domination Number (BDN) of G and is denoted by(G). The investigations over this parameter pull out its wide applications in every supplementary graph theoretical concepts. Now by the collective appliances of removal of lines, the study narrowed towards higher applications. The force of the special effects of exclusion of a node or a line or more, on any graph theoretic parameter has appealing applications in the framework of network, both constructively and economically. And hence, over the extensive investigations of the Blast domination number, this article brings out the vibrant transform of the parameter by unlinking. The theoretic properties of Blast domination number and its accurate values for some customary graphs are derived by unlinking process. The relations between Blast domination number of a graph and the effects of unlinking are also pragmatic.

Item Type: Book Section
Subjects: Apsci Archives > Computer Science
Depositing User: Unnamed user with email support@apsciarchives.com
Date Deposited: 30 Dec 2023 08:59
Last Modified: 30 Dec 2023 08:59
URI: http://eprints.go2submission.com/id/eprint/2508

Actions (login required)

View Item
View Item