Journal article Open Access

Continuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm

C. Sujatha; A. Manickam

Sponsor(s)
Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP)

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
H0103072819.pdf
md5:6dd7476cfca3290d0bfd0709959d95c5
387.8 kB Download
17
16
views
downloads
Views 17
Downloads 16
Data volume 6.2 MB
Unique views 17
Unique downloads 16

Share

Cite as