Open AccessContinuous Monotonic Decomposition of Some Standard Graphs by using an Algorithm
Author(s) -
C Sujatha,
A. Manickam
Publication year - 2019
Publication title -
international journal of basic sciences and applied computing
Language(s) - English
Resource type - Journals
ISSN - 2394-367X
DOI - 10.35940/ijbsac.h0103.072819
Subject(s) - monotonic function , bipartite graph , tensor product , mathematics , decomposition , disjoint sets , combinatorics , decomposition method (queueing theory) , discrete mathematics , algorithm , star (game theory) , product (mathematics) , graph , pure mathematics , mathematical analysis , ecology , geometry , biology
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