<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://10.9.150.37:8080/dspace//handle/atmiyauni/509</link>
    <description />
    <pubDate>Mon, 27 Apr 2026 18:56:16 GMT</pubDate>
    <dc:date>2026-04-27T18:56:16Z</dc:date>
    <item>
      <title>About -ve domination in graphs</title>
      <link>http://10.9.150.37:8080/dspace//handle/atmiyauni/804</link>
      <description>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.</description>
      <pubDate>Wed, 06 Sep 2017 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://10.9.150.37:8080/dspace//handle/atmiyauni/804</guid>
      <dc:date>2017-09-06T00:00:00Z</dc:date>
    </item>
    <item>
      <title>On edge-edge domination in graphs</title>
      <link>http://10.9.150.37:8080/dspace//handle/atmiyauni/803</link>
      <description>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.</description>
      <pubDate>Thu, 01 Jun 2017 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://10.9.150.37:8080/dspace//handle/atmiyauni/803</guid>
      <dc:date>2017-06-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

