<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/509" />
  <subtitle />
  <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/509</id>
  <updated>2026-04-27T18:59:17Z</updated>
  <dc:date>2026-04-27T18:59:17Z</dc:date>
  <entry>
    <title>About -ve domination in graphs</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/804" />
    <author>
      <name>Thakkar, D.K.</name>
    </author>
    <author>
      <name>Jamvecha, Neha P.</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/804</id>
    <updated>2023-05-01T02:41:50Z</updated>
    <published>2017-09-06T00:00:00Z</published>
    <summary type="text">Title: About -ve domination in graphs
Authors: Thakkar, D.K.; Jamvecha, Neha P.
Abstract: The paper is about the ve-domination (vertex-edge domination) in graphs. &#xD;
Necessary and sufficient conditions are proved under which the ve-domination number &#xD;
decreases or increases.
Description: Acknowledgement: The authors are thankful to the reviewer for their comments and &#xD;
suggestions for improving the quality of this paper.</summary>
    <dc:date>2017-09-06T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>On edge-edge domination in graphs</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/803" />
    <author>
      <name>Thakkar, D.K.</name>
    </author>
    <author>
      <name>Jamvecha, N.P.</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/803</id>
    <updated>2023-05-01T02:32:19Z</updated>
    <published>2017-06-01T00:00:00Z</published>
    <summary type="text">Title: On edge-edge domination in graphs
Authors: Thakkar, D.K.; Jamvecha, N.P.
Abstract: In this paper we further study the concept of edge-edge domination in graphs. We observe that the edge-edge &#xD;
domination number of a graph may increase or decrease or remains same when a edge is removed from a graph. We &#xD;
proved a necessary and sufficient condition under which the edge-edge domination number of a graph increases and &#xD;
also we proved a necessary and sufficient condition under which the edge-edge domination number of a graph &#xD;
decreases. For this purpose we introduce two new concepts namely e-dominating neighbourhood of an edge and &#xD;
private edge-edge neighbourhood of an edge with respect to a set containing the edge. Some examples also have been &#xD;
given.
Description: Acknowledgement:&#xD;
The authors are thankful to the reviewer for their comments and suggestions for improving the quality of this paper.</summary>
    <dc:date>2017-06-01T00:00:00Z</dc:date>
  </entry>
</feed>

