Share Your Research, Maximize Your Social Impacts
Unique Enresdowed Graphs
Journal: International Journal of Innovative Research in Applied Sciences and Engineering (Vol.1, No. 2)Publication Date: 2017-08-07
Authors : Dr.P.Sumathi R.Esther Felicia;
Page : 66-72
Keywords : : Dominating set; Domination number; Restrained Domination; Private Neighbour; enresdowed graphs.;
Source : Download
Find it from : Google Scholar
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
- A Review of Watermarking Requirements, Techniques, Documents, Human Perception and Applications for Medical Images
- A Study on Cyber and Network Forensic in Computer Security Management
- New Frameworks for Automated Test and Retest (ATRT) Test Case Requirement Traceability Matrix
- Assessment on Security Issues and Classification in Cloud Computing
- Reducing DDOS Attack Techniques in Cloud Computing Network Technology
Last modified: 2018-01-15 19:48:14