August 24, 2026 Thesis Open Access

Abdata Guluma Erana

DCAT Export

<?xml version='1.0' encoding='utf-8'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#">
  <rdf:Description rdf:about="https://doi.org/10.20372/nadre:25797">
    <rdf:type rdf:resource="http://www.w3.org/ns/dcat#Dataset"/>
    <dct:type rdf:resource="http://purl.org/dc/dcmitype/Text"/>
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://doi.org/10.20372/nadre:25797</dct:identifier>
    <foaf:page rdf:resource="https://doi.org/10.20372/nadre:25797"/>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Abdata Guluma Erana</foaf:name>
      </rdf:Description>
    </dct:creator>
    <dct:title>A Study on Domination in Turiyam Graphs with Algorithms and Applications</dct:title>
    <dct:publisher>
      <foaf:Agent>
        <foaf:name>Zenodo</foaf:name>
      </foaf:Agent>
    </dct:publisher>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2026</dct:issued>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2026-08-24</dct:issued>
    <owl:sameAs rdf:resource="https://nadre.ethernet.edu.et/record/25797"/>
    <adms:identifier>
      <adms:Identifier>
        <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://nadre.ethernet.edu.et/record/25797</skos:notation>
        <adms:schemeAgency>url</adms:schemeAgency>
      </adms:Identifier>
    </adms:identifier>
    <dct:isVersionOf rdf:resource="https://doi.org/10.20372/nadre:25796"/>
    <dct:isPartOf rdf:resource="https://nadre.ethernet.edu.et/communities/20-25"/>
    <dct:description>&lt;p&gt;Abstract This dissertation investigates domination properties in Turiyam graphs, focusing on the development of theoretical results, efficient algorithms, and practical applications in graph theory. Domination theory plays a significant role in network design, communication systems, optimization, and resource allocation, where identifying minimum dominating structures is essential for efficient control and monitoring of complex systems. In this study, various domination parameters in Turiyam graphs, including domination number, total domination, connected domination, and independent domination, are examined in detail. The structural characteristics of Turiyam graphs are analyzed to understand how graph configurations influence domination properties and algorithmic behavior. To address the computational challenges associated with domination problems, efficient graph-theoretic algorithms are developed for determining dominating sets and related parameters in Turiyam graphs. The proposed algorithms are designed using systematic graph construction techniques and optimized procedures to improve computational efficiency and accuracy. Illustrative examples are presented to validate the theoretical findings and demonstrate the effectiveness of the proposed algorithms. The results show that the developed methods provide accurate and computationally efficient solutions for domination-related problems in Turiyam graphs. Comparative analysis with existing graph domination approaches further highlights improvements in performance, scalability, and robustness. The applications discussed in this work emphasize the usefulness of domination concepts in communication networks, social network analysis, facility location problems, and optimization systems, thereby contributing to both theoretical graph theory and practical real-world problem solving.&lt;/p&gt;</dct:description>
    <dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/>
    <dct:accessRights>
      <dct:RightsStatement rdf:about="info:eu-repo/semantics/openAccess">
        <rdfs:label>Open Access</rdfs:label>
      </dct:RightsStatement>
    </dct:accessRights>
    <dcat:distribution>
      <dcat:Distribution>
        <dcat:accessURL rdf:resource="https://doi.org/10.20372/nadre:25797"/>
      </dcat:Distribution>
    </dcat:distribution>
    <dcat:distribution>
      <dcat:Distribution>
        <dcat:accessURL rdf:resource="https://doi.org/10.20372/nadre:25797"/>
        <dcat:byteSize>2845486</dcat:byteSize>
        <dcat:downloadURL rdf:resource="https://nadre.ethernet.edu.et/record/25797/files/Final Dissertation Abdi.pdf"/>
        <dcat:mediaType>application/pdf</dcat:mediaType>
      </dcat:Distribution>
    </dcat:distribution>
  </rdf:Description>
</rdf:RDF>