Asian Journal of Engineering and Applied Technology (AJEAT)
Editor Dr. Seshadri Ramkumar
Print ISSN : 2249-068X
Frequency : Quarterly
On Some Complete Tripartite Graphs that Decline Continuous Monotonic Decomposition
Author : Joseph Varghese 1 and A. Antonysamy 2Volume 1 No.1 January-June 2012 pp
Abstract
1Department of Mathematics, Christ University, Bangalore – 560 029, Karnataka, India
2 Department of Mathematics, St. Xavier’s College, Kathmandu, Nepal
E-mail: [email protected], [email protected]
(Received on 15 December 2011 and accepted on 05 March 2012)Abstract
2 Department of Mathematics, St. Xavier’s College, Kathmandu, Nepal
E-mail: [email protected], [email protected]
(Received on 15 December 2011 and accepted on 05 March 2012)Abstract
A collection of complete tripartite graphs, viz., K1,3,m, K2,3m, K2,5m and K3,5,m do not accept Continuous Monotonic Decomposition(CMD). It is shown that by an addition or removal of a single edge will make these graphs accept CMD. Eventually, the discussion helps to find a series of numbers which are not triangular.
Keywords
Graph Decomposition, Extremal Graphs, Complete Tripartite Graphs, Continuous Monotonic Decomposition, Triangular Numbers
Full Text:
