Non DSS to DSS Graphs

Authors

  • M. Yamuna SAS, VIT, Vellore, Tamilnadu, India.
  • K. Karthika SAS, VIT, Vellore, Tamilnadu, India.

DOI:

https://doi.org/10.9734/bpi/tipr/v6/2366F

Keywords:

Domination, subdivision, contraction, non DSS graph, DSS graph

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.

Published

2021-06-10

How to Cite

M. Yamuna, & K. Karthika. (2021). Non DSS to DSS Graphs. Technological Innovation in Pharmaceutical Research Vol. 6, 119–124. https://doi.org/10.9734/bpi/tipr/v6/2366F

Issue

Technological Innovation in Pharmaceutical Research Vol. 6

Section

Chapters