Journal article Open Access

Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm

C. Sujatha; A. Manickam


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://zenodo.org/record/5482723">
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/5482723</dct:identifier>
    <foaf:page rdf:resource="https://zenodo.org/record/5482723"/>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>C. Sujatha</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Principal, Professor of Mathematics, MaruduPandiyar College, Vallam Post, Thanjavur (Tamil Nadu), India.</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>A. Manickam</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Associate Professor of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&amp;D Institute of Science and Technology, (Deemed to be University), Avadi-Veltech Chennai (Tamil Nadu), India</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:title>Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm</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">2019</dct:issued>
    <dcat:keyword>Complete bipartite graph, Continuous monotonic star decomposition, Tensor product. Mathematical subject classification: 03B52, 03E72, 08A72</dcat:keyword>
    <dct:subject>
      <skos:Concept>
        <skos:prefLabel>2394-367X</skos:prefLabel>
        <skos:inScheme>
          <skos:ConceptScheme>
            <dct:title>issn</dct:title>
          </skos:ConceptScheme>
        </skos:inScheme>
      </skos:Concept>
    </dct:subject>
    <dct:subject>
      <skos:Concept>
        <skos:prefLabel>H0103072819/19©BEIESP</skos:prefLabel>
        <skos:inScheme>
          <skos:ConceptScheme>
            <dct:title>handle</dct:title>
          </skos:ConceptScheme>
        </skos:inScheme>
      </skos:Concept>
    </dct:subject>
    <schema:sponsor>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP)</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Publisher</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </schema:sponsor>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2019-07-20</dct:issued>
    <owl:sameAs rdf:resource="https://zenodo.org/record/5482723"/>
    <adms:identifier>
      <adms:Identifier>
        <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/5482723</skos:notation>
        <adms:schemeAgency>url</adms:schemeAgency>
      </adms:Identifier>
    </adms:identifier>
    <dct:relation rdf:resource="http://issn.org/resource/ISSN/2394-367X"/>
    <owl:sameAs rdf:resource="https://doi.org/10.35940/ijbsac.H0103.072819"/>
    <dct:description>&lt;p&gt;In this paper we elaborate an algorithm to compute the necessary and sufficient conditions for the continuous monotonic star decomposition of the bipartite graph Km,r and the number of vertices and the number of disjoint sets. Also an algorithm to find the tensor product of Pn  Ps has continuous monotonic path decomposition. Finally we conclude that in this paper the results described above are complete bipartite graphs that accept Continuous monotonic star decomposition. There are many other classes of complete tripartite graphs that accept Continuous monotonic star decomposition. In this research article Extended to complete m-partite graphs for grater values of m. Also the algorithm can be developed for the tensor product of different classes such as Cn Wn K1,n , , with Pn&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>
    <dct:license rdf:resource="https://creativecommons.org/licenses/by/4.0/legalcode"/>
    <dcat:distribution>
      <dcat:Distribution>
        <dcat:accessURL rdf:resource="https://doi.org/10.35940/ijbsac.H0103.072819"/>
        <dcat:byteSize>387767</dcat:byteSize>
        <dcat:downloadURL rdf:resource="https://zenodo.org/record/5482723/files/H0103072819.pdf"/>
        <dcat:mediaType>application/pdf</dcat:mediaType>
      </dcat:Distribution>
    </dcat:distribution>
  </rdf:Description>
</rdf:RDF>
17
18
views
downloads
Views 17
Downloads 18
Data volume 7.0 MB
Unique views 17
Unique downloads 18

Share

Cite as