Unique Enresdowed Graphs
Journal: International Journal of Innovative Research in Applied Sciences and Engineering (Vol.1, No. 3)Publication Date: 2017-09-07
Authors : Dr.P.Sumathi; R.Esther Felicia;
Page : 66-72
Keywords : Dominating set; Domination number; Restrained Domination; Private Neighbour; enresdowed graphs;
Abstract
Let G = (V, E) be a non empty, finite, simple graph. k - γr enresdowed graph is one in which every restrained dominating set of cardinality k contains a minimum restrained dominating set. In this paper, we discovered a few outcomes for the k - γr enresdowed graph related to private neighborhood.
Other Latest Articles
- EFFECT OF COMMUNITY BASED AREA-WIDE FRUIT FLY SUPPRESSION ON BACTROCERA DORSALIS POPULATION IN ORANGE ORCHARDS IN MUHEZA DISTRICT TANZANIA
- A STUDY ON NEW HIRING STRATEGIES TO MANAGE TALENT CRISIS AT ENTRY LEVEL FROM THE PERSPECTIVE OF RECRUITERS AND FRESH GRADUATE ENGINEER JOB SEEKERS
- A Review of Watermarking Requirements, Techniques, Documents, Human Perception and Applications for Medical Images
- GOODS AND SERVICES TAX: A STUDY ON ROAD MAP FOR 2017
- A Study on Cyber and Network Forensic in Computer Security Management
Last modified: 2017-08-28 19:09:44