Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/803
Title: On edge-edge domination in graphs
Authors: Thakkar, D.K.
Jamvecha, N.P.
Keywords: edge-edge dominating set
minimal edge-edge dominating set
minimum edge-edge dominating set
e-dominating neighbourhood
Private edge-edge neighbourhood
edge-edge domination number
Issue Date: Jun-2017
Publisher: International Journal of Mathematical Archive
Citation: THAKKAR, D., & JAMVECHA, N. (2017). International Journal of Mathematical Archive-8 (6), 2017, 227-231 Available online through www. ijma. info ISSN 2229–5046.
Abstract: In this paper we further study the concept of edge-edge domination in graphs. We observe that the edge-edge domination number of a graph may increase or decrease or remains same when a edge is removed from a graph. We proved a necessary and sufficient condition under which the edge-edge domination number of a graph increases and also we proved a necessary and sufficient condition under which the edge-edge domination number of a graph decreases. For this purpose we introduce two new concepts namely e-dominating neighbourhood of an edge and private edge-edge neighbourhood of an edge with respect to a set containing the edge. Some examples also have been given.
Description: Acknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/803
ISSN: 2229-5046
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
411) 67814_Nehaben Pankajbhai Jamvecha.pdf163.13 kBAdobe PDFView/Open
Show full item record


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