<?xml version="1.0" encoding="UTF-8"?>
<item xmlns="http://omeka.org/schemas/omeka-xml/v5" itemId="14056" 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/14056?output=omeka-xml" accessDate="2026-05-01T16:20:43+00:00">
  <collection collectionId="5">
    <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="64">
                <text>Articles</text>
              </elementText>
            </elementTextContainer>
          </element>
        </elementContainer>
      </elementSet>
    </elementSetContainer>
  </collection>
  <itemType itemTypeId="19">
    <name>Article</name>
    <description>Faculty Publications -Articles</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="50">
          <name>Title</name>
          <description>A name given to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93656">
              <text>Cyclic property of iterative eccentrication of a graph</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="49">
          <name>Subject</name>
          <description>The topic of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93657">
              <text>eccentric graph; eccentrication; Eccentricity; iterative eccentric graphs; ?-cycle</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="41">
          <name>Description</name>
          <description>An account of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93658">
              <text>The eccentric graph of a graph G, denoted by Ge, is a derived graph with the vertex set same as that of G and two vertices in Ge are adjacent if one of them is an eccentric vertex of the other. The process of constructing iterative eccentric graphs, denoted by Gek is called eccentrication. A graph G is said to be ?-cyclic(t,l) if G,Ge,Ge2,...,Gek,Gek+1,...,Gek+l are the only non-isomorphic graphs, and the graph Gek+l+1 is isomorphic to Gek. In this paper, we prove the existence of an ?-cycle for any simple graph. The importance of this result lies in the fact that the enumeration of eccentrication of a graph reduces to a finite problem. Furthermore, the enumeration of a corresponding sequence of graph parameters such as chromatic number, domination number, independence number, minimum and maximum degree, etc., reduces to a finite problem.  2023 World Scientific Publishing Company.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="39">
          <name>Creator</name>
          <description>An entity primarily responsible for making the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93659">
              <text>Raja M.R.; Kok J.; Mangam T.A.; Naduvath S.</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="93660">
              <text>Discrete Mathematics, Algorithms and Applications, Vol-15, No. 7</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="45">
          <name>Publisher</name>
          <description>An entity responsible for making the resource available</description>
          <elementTextContainer>
            <elementText elementTextId="93661">
              <text>World Scientific</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="93662">
              <text>2023-01-01</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="93663">
              <text>&lt;a href="https://doi.org/10.1142/S1793830922501555" target="_blank" rel="noreferrer noopener"&gt;https://doi.org/10.1142/S1793830922501555&lt;/a&gt;
&lt;br /&gt;&lt;br /&gt;&lt;a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85166097494&amp;amp;doi=10.1142%2FS1793830922501555&amp;amp;partnerID=40&amp;amp;md5=36936af91b5c79ff02d8fc829e21e351" target="_blank" rel="noreferrer noopener"&gt;https://www.scopus.com/inward/record.uri?eid=2-s2.0-85166097494&amp;amp;doi=10.1142%2fS1793830922501555&amp;amp;partnerID=40&amp;amp;md5=36936af91b5c79ff02d8fc829e21e351&lt;/a&gt;</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="47">
          <name>Rights</name>
          <description>Information about rights held in and over the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93664">
              <text>Restricted Access</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="46">
          <name>Relation</name>
          <description>A related resource</description>
          <elementTextContainer>
            <elementText elementTextId="93665">
              <text>ISSN: 17938309</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="93666">
              <text>Online</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="44">
          <name>Language</name>
          <description>A language of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93667">
              <text>English</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="51">
          <name>Type</name>
          <description>The nature or genre of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="93668">
              <text>Article</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="38">
          <name>Coverage</name>
          <description>The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant</description>
          <elementTextContainer>
            <elementText elementTextId="93669">
              <text>Raja M.R., Department of Mathematics, Christ (Deemed to Be University), Karnataka, Bangalore, 560029, India; Kok J., Department of Mathematics, Christ (Deemed to Be University), Karnataka, Bangalore, 560029, India; Mangam T.A., Department of Mathematics, Christ (Deemed to Be University), Karnataka, Bangalore, 560029, India; Naduvath S., Department of Mathematics, Christ (Deemed to Be University), Karnataka, Bangalore, 560029, India</text>
            </elementText>
          </elementTextContainer>
        </element>
      </elementContainer>
    </elementSet>
  </elementSetContainer>
</item>
