<?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>December 2008 </publicationDate>
    <volume>20</volume>
    <issue>3</issue>
    <startPage>709</startPage>
    <endPage>712</endPage>
    <doi>jusps-B</doi>
    <publisherRecordId>1395</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">On the circular chromatic number of deleted vertex subgraphs </title>
    <authors>
      <author>
        <name>R. Ganapathy Raman</name>
        <affiliationId>1</affiliationId>
      </author>
      <author>
        <name>R. Sattanathan</name>
        <affiliationId>2</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Lecturer, Department of Maths, D.G., Vaishnav College, Chennai &amp; Research Scholar in Scsvmvu (INDIA)</affiliationName>
      <affiliationName affiliationId="2">Reader &amp; H.O.D, of maths, D.G., Vaishanav College, Chennai (INDIA) (Sri Chandra Sekara Sarasawathi Viswamaha Vidyalaya, University, Kanchipuram (INDIA)</affiliationName>
    </affiliationsList>
    <abstract language="eng">&lt;p style="text-align: justify;"&gt;An alternative approach to the existence of a vertex n &amp;Icirc; V(G) such that c(G - n) &amp;sup3; c(G) - 1 is presented. If such a vertex exists for a planar graph, we show that there must also be one of minimum degree.&lt;br /&gt;&#xD;
&amp;nbsp;&lt;/p&gt;&#xD;
</abstract>
    <fullTextUrl format="html">https://ultraphysicalsciences.org/paper/1395/</fullTextUrl>
    <keywords>
      <keyword language="eng">Chromatic numbers </keyword>
    </keywords>
    <keywords>
      <keyword language="eng">star</keyword>
    </keywords>
    <keywords>
      <keyword language="eng">number.</keyword>
    </keywords>
  </record>
</records>
