http://10.9.150.37:8080/dspace//handle/atmiyauni/509 2026-03-13T21:10:19Z http://10.9.150.37:8080/dspace//handle/atmiyauni/804 About -ve domination in graphs Thakkar, D.K.; Jamvecha, Neha P. The paper is about the ve-domination (vertex-edge domination) in graphs. Necessary and sufficient conditions are proved under which the ve-domination number decreases or increases. Acknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper. 2017-09-06T00:00:00Z http://10.9.150.37:8080/dspace//handle/atmiyauni/803 On edge-edge domination in graphs Thakkar, D.K.; Jamvecha, N.P. 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. Acknowledgement: The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper. 2017-06-01T00:00:00Z