<?xml version="1.0" encoding="UTF-8"?>
<item xmlns="http://omeka.org/schemas/omeka-xml/v5" itemId="12295" 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/12295?output=omeka-xml" accessDate="2026-04-16T06:32:41+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="69112">
              <text>61000242</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="50">
          <name>Title</name>
          <description>A name given to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69113">
              <text>Topologies Emanating From Graphs  </text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="49">
          <name>Subject</name>
          <description>The topic of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69114">
              <text>Mathematics and Statistics</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="41">
          <name>Description</name>
          <description>An account of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69115">
              <text>A topology on a set is a collection of its subsets, including the set itself and the empty set, which is closed under union and fnite intersections. This dissertation introduces the notions such as graph topology, spanning graph topology, generalised graph topology, and generalised spanning graph topology by considering subgraphs and spanning subgraphs of a graph. Analogous to the set-theoretic notion, a graph topology is a collection of subgraphs of a given graph, including the null graph K0 and the graph itself, that is closed under newlineany union and any intersection. At the same time, a spanning graph topology of a graph is a collection of spanning subgraphs, including the spanning empty graph Nn, where n is the order of the graph and the graph G, which is closed under any union and any intersection. The topological concepts such as open sets, closed sets, base, subbase, neighbourhood, interior, subspace, and connectedness of spaces are extended to graph topology and spanning graph topology. In order to study the closed graphs in the above-mentioned graph topologies, two new graph complements are introduced in these graph topologies, such as decomposition and neighbourhood complements, to defne decomposition closed newlineand neighbourhood closed graphs. The decomposition complement is defned with respect to the edge set and the neighbourhood complement with respect to the vertex set. Since all the members of a spanning graph topology have the same vertex set, the neighbourhood closed graphs are described in terms of the edge set. The notion and characteristics of subspaces of both these graph topologies are defned, and the properties of closed graphs in these subspaces are also studied. Connectedness in topology holds a prominent role and applications in various felds of mathematics. The idea of connectedness is extended newlineto these graph topologies, and the same is characterised in the context of graph newlinetopology.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="39">
          <name>Creator</name>
          <description>An entity primarily responsible for making the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69116">
              <text>Aniyan,Achu</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="69117">
              <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="69118">
              <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="69119">
              <text>2023-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="69120">
              <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="69121">
              <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="69122">
              <text>PDF</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="44">
          <name>Language</name>
          <description>A language of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69123">
              <text>English</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="51">
          <name>Type</name>
          <description>The nature or genre of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="69124">
              <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="69125">
              <text>&lt;a href="http://hdl.handle.net/10603/511502" target="_blank" rel="noreferrer noopener"&gt;http://hdl.handle.net/10603/511502&lt;/a&gt;</text>
            </elementText>
          </elementTextContainer>
        </element>
      </elementContainer>
    </elementSet>
  </elementSetContainer>
</item>
