Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1832
Title: On restrained edge dominating set of graphs
Authors: Vaidya, S. K.
Ajan, P. D.
Keywords: Dominating set
restrained dominating set
restrained edge dominating set
restrained edge
domination number.
Issue Date: 2020
Publisher: Malaya Journal of Matematik
Citation: S. K. Vaidya and P. D. Ajan, On restrained edge dominating set of graphs,Malaya Journal of Matematik, Vol. 7, No. 1, 104-107, 2019
Abstract: For a graph G = (V, E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent to an edge in D as well as an edge in E − D. The restrained edge domination number of G, denoted by γre(G) is the minimum cardinality of a restrained edge dominating set of G. Here, we characterize restrained edge dominating set and also investigate restrained edge domination number of some wheel related graphs.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1832
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
On restrained edge dominating set of graphs.pdf1.44 MBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.