<?xml version="1.0" encoding="UTF-8"?>
<item xmlns="http://omeka.org/schemas/omeka-xml/v5" itemId="12362" public="1" featured="0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://omeka.org/schemas/omeka-xml/v5 http://omeka.org/schemas/omeka-xml/v5/omeka-xml-5-0.xsd" uri="https://archives.christuniversity.in/items/show/12362?output=omeka-xml" accessDate="2026-04-25T05:38:39+00:00">
  <collection collectionId="24">
    <elementSetContainer>
      <elementSet elementSetId="1">
        <name>Dublin Core</name>
        <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
        <elementContainer>
          <element elementId="50">
            <name>Title</name>
            <description>A name given to the resource</description>
            <elementTextContainer>
              <elementText elementTextId="64990">
                <text>PHD</text>
              </elementText>
            </elementTextContainer>
          </element>
        </elementContainer>
      </elementSet>
    </elementSetContainer>
  </collection>
  <itemType itemTypeId="22">
    <name>PhD</name>
    <description>PhD Thesis</description>
  </itemType>
  <elementSetContainer>
    <elementSet elementSetId="1">
      <name>Dublin Core</name>
      <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
      <elementContainer>
        <element elementId="46">
          <name>Relation</name>
          <description>A related resource</description>
          <elementTextContainer>
            <elementText elementTextId="70050">
              <text>61000316</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="50">
          <name>Title</name>
          <description>A name given to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70051">
              <text>A Study on Near Proper Coloring of Graphs  </text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="49">
          <name>Subject</name>
          <description>The topic of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70052">
              <text>Mathematics and Statistics</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="41">
          <name>Description</name>
          <description>An account of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70053">
              <text>An equitable coloring of a graph G is a proper vertex coloring in which the number of vertices in any two color classes are equal or almost equal. In this graph coloring, there is a partition of tasks into subsets which perform at the same time. Equitable coloring play an important role when there is a requirement of dividing a system with binary conand#64258;ict free subsystems with equal or newlinenearly equal elements. The non-availability of sufcient number of colors leads to diand#64256;erent defective coloring problems. An equitable near proper coloring of a graph G is an improper coloring in which the vertex set can be partitioned into k color classes V1, V2, . . . , Vk ; (1 lt k lt and#967;e(G)) such that the number of vertices in any two color classes diand#64256;er by at most one and the resulting monochromatic edges are minimised by restricting the number of color classes that can have adjacency among their own elements. The minimum number of monochromatic newlineedges obtained from an equitable near proper coloring of G is called equitable defective number. This study introduces the notion of equitable near proper coloring of a graph G and investigates the equitable defective number for a few graph classes. In this study, the equitable near proper coloring of various graph classes and derived graphs are discussed, and the corresponding equitable newlinedefective number for any k where 2 and#8804; k and#8804; and#967;e(G) and#8722; 1 is obtained.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="39">
          <name>Creator</name>
          <description>An entity primarily responsible for making the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70054">
              <text>Jose, Sabitha</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="48">
          <name>Source</name>
          <description>A related resource from which the described resource is derived</description>
          <elementTextContainer>
            <elementText elementTextId="70055">
              <text>Author's Submission</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="45">
          <name>Publisher</name>
          <description>An entity responsible for making the resource available</description>
          <elementTextContainer>
            <elementText elementTextId="70056">
              <text>Christ(Deemed to be University)</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="40">
          <name>Date</name>
          <description>A point or period of time associated with an event in the lifecycle of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70057">
              <text>2024-01-01</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="37">
          <name>Contributor</name>
          <description>An entity responsible for making contributions to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70058">
              <text>N K, Sudev</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="47">
          <name>Rights</name>
          <description>Information about rights held in and over the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70059">
              <text>Open Access</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="42">
          <name>Format</name>
          <description>The file format, physical medium, or dimensions of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70060">
              <text>PDF</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="44">
          <name>Language</name>
          <description>A language of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70061">
              <text>English</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="51">
          <name>Type</name>
          <description>The nature or genre of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="70062">
              <text>PhD</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="43">
          <name>Identifier</name>
          <description>An unambiguous reference to the resource within a given context</description>
          <elementTextContainer>
            <elementText elementTextId="70063">
              <text>&lt;a href="http://hdl.handle.net/10603/563524" target="_blank" rel="noreferrer noopener"&gt;http://hdl.handle.net/10603/563524&lt;/a&gt;</text>
            </elementText>
          </elementTextContainer>
        </element>
      </elementContainer>
    </elementSet>
  </elementSetContainer>
</item>
