<?xml version="1.0"?>
<records>
  <record>
    <language>eng</language>
    <publisher>Ansari Education and Research Society</publisher>
    <journalTitle>Journal of Ultra Scientist of Physical Sciences</journalTitle>
    <issn/>
    <eissn/>
    <publicationDate>August 2010 </publicationDate>
    <volume>22</volume>
    <issue>2</issue>
    <startPage>467</startPage>
    <endPage>472</endPage>
    <doi>jusps-A</doi>
    <publisherRecordId>994</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">Total number of perfect dominating sets of graphs</title>
    <authors>
      <author>
        <name>G. Deepak (deepak1873@gmail.com)</name>
        <affiliationId>1</affiliationId>
      </author>
      <author>
        <name> N.D. Soner (ndsoner@yhaoo.com.in)</name>
        <affiliationId>1</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Department of Mathematics, University of Mysore - Manasagangotri, Mysore - 570006 (INDIA)</affiliationName>
    </affiliationsList>
    <abstract language="eng">&lt;p style="text-align: justify;"&gt;This paper is concerned with special kinds of perfect dominating sets of the graphs P&lt;sub&gt;n &lt;/sub&gt;and C&lt;sub&gt;n&lt;/sub&gt;. The perfect dominating set, the split perfect dominating sets of a graph are also considered. Using a recurrence relation we give the number of all perfect dominating sets mentioned for the graphs P&lt;sub&gt;n &lt;/sub&gt;and C&lt;sub&gt;n&lt;/sub&gt;.&lt;/p&gt;&#xD;
&#xD;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xD;
&#xD;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;&#xD;
</abstract>
    <fullTextUrl format="html">https://www.ultrascientist.org/paper/994/</fullTextUrl>
    <keywords>
      <keyword language="eng">Graphs</keyword>
    </keywords>
    <keywords>
      <keyword language="eng">Perfect dominating sets</keyword>
    </keywords>
    <keywords>
      <keyword language="eng">split perfect dominating sets</keyword>
    </keywords>
  </record>
</records>
