<?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>06. Department of Mathematics</title>
<link href="http://10.9.150.37:8080/dspace//handle/atmiyauni/246" rel="alternate"/>
<subtitle/>
<id>http://10.9.150.37:8080/dspace//handle/atmiyauni/246</id>
<updated>2026-05-10T15:06:30Z</updated>
<dc:date>2026-05-10T15:06:30Z</dc:date>
<entry>
<title>Open Packing Number of Triangular Snakes</title>
<link href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2216" rel="alternate"/>
<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">Open Packing Number of Triangular Snakes
Vaidya, S.K.; Parmar, A.D.
A set S ⊆ V (G) of vertices in a graph G is called a packing of G if the closed&#13;
neighborhood of the vertices of S are pairwise disjoint in G. A subset S of V (G) is called&#13;
an open packing of G if the open neighborhood of the vertices of S are pairwise disjoint in&#13;
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 href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2213" rel="alternate"/>
<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">Application of Graph Theory in Various Field of Applied Science &amp; Engineering
Teraiya, O. M.
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 href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2202" rel="alternate"/>
<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">Sub-Restrained Perfect Domination In Graphs
Bhatt, Tushhar
et &#119866;=(&#119881;(&#119866;),&#119864;(&#119866;))be a connected graph. Let &#119872;⊆&#119881;(&#119866;)be a minimum perfect dominating set and &#119879;⊆&#119881;(&#119866;)\&#119872;is  said to be sub-restrained  perfect dominating setof Gif every &#119907;∈&#119881;(&#119866;)∖&#119879;such that|&#119873;(&#119907;)∩&#119879;|=1. The sub-restrained perfect dominating number of &#119866;is the minimum cardinality of thesub-restrained perfect dominating set of &#119866;which is denoted by&#120574;&#119904;&#119903;&#119901;(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 href="http://10.9.150.37:8080/dspace//handle/atmiyauni/2196" rel="alternate"/>
<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">SOME PPF DEPENDENT FIXED POINT RESULTS FOR PREŠIĆ-HARDY-ROGERS CONTRACTIONS
Swami, Monika
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>
