<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://10.9.150.37:8080/dspace//handle/atmiyauni/246">
<title>06. Department of Mathematics</title>
<link>http://10.9.150.37:8080/dspace//handle/atmiyauni/246</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://10.9.150.37:8080/dspace//handle/atmiyauni/2216"/>
<rdf:li rdf:resource="http://10.9.150.37:8080/dspace//handle/atmiyauni/2213"/>
<rdf:li rdf:resource="http://10.9.150.37:8080/dspace//handle/atmiyauni/2202"/>
<rdf:li rdf:resource="http://10.9.150.37:8080/dspace//handle/atmiyauni/2196"/>
</rdf:Seq>
</items>
<dc:date>2026-05-10T15:05:51Z</dc:date>
</channel>
<item rdf:about="http://10.9.150.37:8080/dspace//handle/atmiyauni/2216">
<title>Open Packing Number of Triangular Snakes</title>
<link>http://10.9.150.37:8080/dspace//handle/atmiyauni/2216</link>
<description>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.
</description>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://10.9.150.37:8080/dspace//handle/atmiyauni/2213">
<title>Application of Graph Theory in Various Field of Applied Science &amp; Engineering</title>
<link>http://10.9.150.37:8080/dspace//handle/atmiyauni/2213</link>
<description>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.
</description>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://10.9.150.37:8080/dspace//handle/atmiyauni/2202">
<title>Sub-Restrained Perfect Domination In Graphs</title>
<link>http://10.9.150.37:8080/dspace//handle/atmiyauni/2202</link>
<description>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.
</description>
<dc:date>2024-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://10.9.150.37:8080/dspace//handle/atmiyauni/2196">
<title>SOME PPF DEPENDENT FIXED POINT RESULTS FOR PREŠIĆ-HARDY-ROGERS CONTRACTIONS</title>
<link>http://10.9.150.37:8080/dspace//handle/atmiyauni/2196</link>
<description>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
</description>
<dc:date>2023-04-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
