Book Publisher International
Published June 10, 2021 | Version Chapter 11
Book chapter Restricted

Non DSS to DSS Graphs

Authors/Creators

  • 1. SAS, VIT, Vellore, Tamilnadu, India.

Description

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.

Files

Restricted

The record is publicly accessible, but files are restricted to users with access.