Journal article Open Access

Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm

C. Sujatha; A. Manickam


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://zenodo.org/record/5482723</identifier>
  <creators>
    <creator>
      <creatorName>C. Sujatha</creatorName>
      <affiliation>Principal, Professor of Mathematics, MaruduPandiyar College, Vallam Post, Thanjavur (Tamil Nadu), India.</affiliation>
    </creator>
    <creator>
      <creatorName>A. Manickam</creatorName>
      <affiliation>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</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <subjects>
    <subject>Complete bipartite graph, Continuous monotonic star decomposition, Tensor product. Mathematical subject classification: 03B52, 03E72, 08A72</subject>
    <subject subjectScheme="issn">2394-367X</subject>
    <subject subjectScheme="handle">H0103072819/19©BEIESP</subject>
  </subjects>
  <contributors>
    <contributor contributorType="Sponsor">
      <contributorName>Blue Eyes Intelligence Engineering  and Sciences Publication (BEIESP)</contributorName>
      <affiliation>Publisher</affiliation>
    </contributor>
  </contributors>
  <dates>
    <date dateType="Issued">2019-07-20</date>
  </dates>
  <resourceType resourceTypeGeneral="JournalArticle"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/5482723</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="ISSN" relationType="IsCitedBy" resourceTypeGeneral="JournalArticle">2394-367X</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.35940/ijbsac.H0103.072819</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&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;</description>
  </descriptions>
</resource>
17
18
views
downloads
Views 17
Downloads 18
Data volume 7.0 MB
Unique views 17
Unique downloads 18

Share

Cite as