Non DSS to DSS Graphs
Channel:
Subscribers:
9,640
Published on ● Video Link: https://www.youtube.com/watch?v=MSNglb9iJoo
Non DSS to DSS Graphs
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.
#Domination #subdivision #contraction #nonDSSgraph #DSSgraph

