Yamuna, M. and Karthika, K. (2021) Non DSS to DSS Graphs. In: Technological Innovation in Pharmaceutical Research Vol. 6. B P International, pp. 119-124. ISBN 978-93-91215-87-3
Full text not available from this repository.
Official URL: https://doi.org/10.9734/bpi/tipr/v6/2366F
Abstract
A graph G is said to be domination subdivision stable (DSS) if g (Gsd uv) = g (G), for all u, v Î V (G), u adjacent to v. The main objective of this article is to develop an iterative procedure of generating a DSS graph from a graph that is not DSS in a finite sequence of iterations. To develop this iterative procedure we have used edge subdivision and edge contraction as a tool.
| Item Type: | Book Section |
|---|---|
| Subjects: | Eprints AP open Archive > Medical Science |
| Depositing User: | Unnamed user with email admin@eprints.apopenarchive.com |
| Date Deposited: | 23 Dec 2023 08:24 |
| Last Modified: | 23 Dec 2023 08:24 |
| URI: | http://asian.go4sending.com/id/eprint/1409 |
Actions (login required)
- View Item