Non DSS to DSS Graphs

If (Gsd uv) = (G), for any u, v V (G), u adjacent to v, a graph G is said to be dominant subdivision stable (DSS). The major goal of this paper is to create an iterative process for producing a DSS graph from a non-DSS graph in a finite number of iterations. We employed edge subdivision and edge contraction as a tool to build this iterative technique.

Author (s) Details

Dr. M. Yamuna
SAS, VIT, Vellore, Tamilnadu, India.

K. Karthika
SAS, VIT, Vellore, Tamilnadu, India.

View Book :-

Leave a Reply

Your email address will not be published. Required fields are marked *

Back To Top