Journal article Open Access
C. Sujatha; A. Manickam
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/2d036daa-2f3e-4dfd-8db0-67248c257be9/H0103072819.pdf" }, "checksum": "md5:6dd7476cfca3290d0bfd0709959d95c5", "bucket": "2d036daa-2f3e-4dfd-8db0-67248c257be9", "key": "H0103072819.pdf", "type": "pdf", "size": 387767 } ], "owners": [ 251664 ], "doi": "10.35940/ijbsac.H0103.072819", "stats": { "version_unique_downloads": 18.0, "unique_views": 17.0, "views": 17.0, "version_views": 17.0, "unique_downloads": 18.0, "version_unique_views": 17.0, "volume": 6979806.0, "version_downloads": 18.0, "downloads": 18.0, "version_volume": 6979806.0 }, "links": { "doi": "https://doi.org/10.35940/ijbsac.H0103.072819", "latest_html": "https://zenodo.org/record/5482723", "bucket": "https://zenodo.org/api/files/2d036daa-2f3e-4dfd-8db0-67248c257be9", "badge": "https://zenodo.org/badge/doi/10.35940/ijbsac.H0103.072819.svg", "html": "https://zenodo.org/record/5482723", "latest": "https://zenodo.org/api/records/5482723" }, "created": "2021-09-07T11:33:54.671066+00:00", "updated": "2021-09-07T13:48:25.024452+00:00", "conceptrecid": "5482722", "revision": 2, "id": 5482723, "metadata": { "access_right_category": "success", "doi": "10.35940/ijbsac.H0103.072819", "description": "<p>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 \uf0b4 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</p>", "contributors": [ { "affiliation": "Publisher", "type": "Sponsor", "name": "Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP)" } ], "title": "Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm", "license": { "id": "CC-BY-4.0" }, "journal": { "volume": "2", "issue": "8", "pages": "6-9", "title": "International Journal of Basic Sciences and Applied Computing (IJBSAC)" }, "relations": { "version": [ { "count": 1, "index": 0, "parent": { "pid_type": "recid", "pid_value": "5482722" }, "is_last": true, "last_child": { "pid_type": "recid", "pid_value": "5482723" } } ] }, "subjects": [ { "term": "ISSN", "scheme": "issn", "identifier": "2394-367X" }, { "term": "Retrieval Number", "scheme": "handle", "identifier": "H0103072819/19\u00a9BEIESP" } ], "keywords": [ "Complete bipartite graph, Continuous monotonic star decomposition, Tensor product. Mathematical subject classification: 03B52, 03E72, 08A72" ], "publication_date": "2019-07-20", "creators": [ { "affiliation": "Principal, Professor of Mathematics, MaruduPandiyar College, Vallam Post, Thanjavur (Tamil Nadu), India.", "name": "C. Sujatha" }, { "affiliation": "Associate Professor of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, (Deemed to be University), Avadi-Veltech Chennai (Tamil Nadu), India", "name": "A. Manickam" } ], "access_right": "open", "resource_type": { "subtype": "article", "type": "publication", "title": "Journal article" }, "related_identifiers": [ { "scheme": "issn", "identifier": "2394-367X", "relation": "isCitedBy", "resource_type": "publication-article" } ] } }
Views | 17 |
Downloads | 18 |
Data volume | 7.0 MB |
Unique views | 17 |
Unique downloads | 18 |