Non DSS to DSS Graphs

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Other literature type 10 Jun 2021Publisher:Book Publisher International (a part of SCIENCEDOMAIN International)

Authors: M. Yamuna; K. Karthika;

doi: 10.9734/bpi/tipr/v6/2366f , 10.5281/zenodo.5520346 , 10.5281/zenodo.5520347

Non DSS to DSS Graphs

- Summary
- Subjects
- Metrics

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.

Related Organizations

Vellore Institute of Technology University
India

Keywords

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

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average