<?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 Community:</title>
  <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/278" />
  <subtitle />
  <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/278</id>
  <updated>2026-04-27T19:00:14Z</updated>
  <dc:date>2026-04-27T19:00:14Z</dc:date>
  <entry>
    <title>Open Packing Number of Triangular Snakes</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2216" />
    <author>
      <name>Vaidya, S.K.</name>
    </author>
    <author>
      <name>Parmar, A.D.</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/2216</id>
    <updated>2025-01-01T12:06:07Z</updated>
    <published>2019-01-01T00:00:00Z</published>
    <summary type="text">Title: Open Packing Number of Triangular Snakes
Authors: Vaidya, S.K.; Parmar, A.D.
Abstract: A set S ⊆ V (G) of vertices in a graph G is called a packing of G if the closed&#xD;
neighborhood of the vertices of S are pairwise disjoint in G. A subset S of V (G) is called&#xD;
an open packing of G if the open neighborhood of the vertices of S are pairwise disjoint in&#xD;
G. We have investigated exact value of these parameters for triangular snakes.</summary>
    <dc:date>2019-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Application of Graph Theory in Various Field of Applied Science &amp; Engineering</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2213" />
    <author>
      <name>Teraiya, O. M.</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/2213</id>
    <updated>2025-01-01T11:56:34Z</updated>
    <published>2019-01-01T00:00:00Z</published>
    <summary type="text">Title: Application of Graph Theory in Various Field of Applied Science &amp; Engineering
Authors: Teraiya, O. M.
Abstract: In this paper, the research has been focus on application of graph theory in various field of Science &amp; Engineering like Chemistry in Caterpillar Trees, Time Table Scheduling in Academics, Communication Network and Computer Science.</summary>
    <dc:date>2019-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Sub-Restrained Perfect Domination In Graphs</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2202" />
    <author>
      <name>Bhatt, Tushhar</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/2202</id>
    <updated>2025-01-01T11:14:49Z</updated>
    <published>2024-01-01T00:00:00Z</published>
    <summary type="text">Title: Sub-Restrained Perfect Domination In Graphs
Authors: Bhatt, Tushhar
Abstract: et 𝐺=(𝑉(𝐺),𝐸(𝐺))be a connected graph. Let 𝑀⊆𝑉(𝐺)be a minimum perfect dominating set and 𝑇⊆𝑉(𝐺)\𝑀is  said to be sub-restrained  perfect dominating setof Gif every 𝑣∈𝑉(𝐺)∖𝑇such that|𝑁(𝑣)∩𝑇|=1. The sub-restrained perfect dominating number of 𝐺is the minimum cardinality of thesub-restrained perfect dominating set of 𝐺which is denoted by𝛾𝑠𝑟𝑝(G). As a novel approach to the study of domination theory, we can attempt to define sub-restrained perfect dominating set   in   this   paper.   We   also   identify   certain   novel   findings,   fundamental characteristics, and so forth.</summary>
    <dc:date>2024-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>SOME PPF DEPENDENT FIXED POINT RESULTS FOR PREŠIĆ-HARDY-ROGERS CONTRACTIONS</title>
    <link rel="alternate" href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2196" />
    <author>
      <name>Swami, Monika</name>
    </author>
    <id>http://10.9.150.37:8080/dspace//handle/atmiyauni/2196</id>
    <updated>2025-01-01T10:59:50Z</updated>
    <published>2023-04-01T00:00:00Z</published>
    <summary type="text">Title: SOME PPF DEPENDENT FIXED POINT RESULTS FOR PREŠIĆ-HARDY-ROGERS CONTRACTIONS
Authors: Swami, Monika
Abstract: In this article, we develop some PPF dependent fixed point results for nonself mapping in Metric spaces for Prešić-Hardy-Rogers contraction, which is generalization of Prešić type contraction, where the domain space abstract is different from range space E. We also include some examples related to our results</summary>
    <dc:date>2023-04-01T00:00:00Z</dc:date>
  </entry>
</feed>

