JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Thakkar, D.K. | |
| dc.contributor.author | Jamvecha, N.P. | |
| dc.date.accessioned | 2023-05-01T02:32:19Z | |
| dc.date.available | 2023-05-01T02:32:19Z | |
| dc.date.issued | 2017-06 | |
| dc.identifier.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. | en_US |
| dc.identifier.issn | 2229-5046 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/803 | |
| dc.description | Acknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper. | en_US |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Mathematical Archive | en_US |
| dc.subject | edge-edge dominating set | en_US |
| dc.subject | minimal edge-edge dominating set | en_US |
| dc.subject | minimum edge-edge dominating set | en_US |
| dc.subject | e-dominating neighbourhood | en_US |
| dc.subject | Private edge-edge neighbourhood | en_US |
| dc.subject | edge-edge domination number | en_US |
| dc.title | On edge-edge domination in graphs | en_US |
| dc.type | Article | en_US |
