Published July 20, 2019 | Version v1
Journal article Open

Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm

  • 1. Principal, Professor of Mathematics, MaruduPandiyar College, Vallam Post, Thanjavur (Tamil Nadu), India.
  • 2. 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
  • 1. Publisher


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



Files (387.8 kB)

Name Size Download all
387.8 kB Preview Download

Additional details

Related works

Is cited by
Journal article: 2394-367X (ISSN)


Retrieval Number