The (A,D) - Ascending Subgraph Decomposition of Cartesian Product of some Simple Graphs

	International Journal of Mathematics Trends and Technology (IJMTT)
	© 2015 by IJMTT Journal
	Volume-21 Number-1
	Year of Publication : 2015
	Authors : S. Asha
	10.14445/22315373/IJMTT-V21P507

S. Asha"The (A,D) - Ascending Subgraph Decomposition of Cartesian Product of some Simple Graphs", International Journal of Mathematics Trends and Technology (IJMTT). V21(1):52-57 May 2015. ISSN:2231-5373. www.ijmttjournal.org. Published by Seventh Sense Research Group.

Abstract
Alavi et al[1] defined Ascending Subgraph Decomposition(ASD) as decomposition of G with size

References
[1] Y. Alavi, A.J. Boals, G. Chartrand, P. Erdos and O.R. Oellerman, The ascending subgraph decomposition problem, Congressus Numerantium, 58 (1987), 7-14.
[2] S. Asha, R. Kala, Continuous Monotonic Decomposition of Tensor Product of Some Simple Graphs, Asian Journal of Current Engineering and Maths, 4 Jul-Aug(2012), 177-184.
[3] F. Harary, Graph Theory, Addition - Wesley Publishing Company Inc, USA, 1969, pp 286.
[4] Huang-Lin Fu, A note on the Ascending Subgraph Decomposition, Discrete Mathematics, 84(1990), 315-318.
[5] A. Nagarajan and S. Navaneethakrishnan, The (a,d) - Ascending subgraph Decomposition, Tamkang Journal of Mathematics, Vol. 37 (2006), No. 4.
[6] A. Nagarajan and S. Navaneethakrishnan, The (a,d) - Ascending subgraph Decomposition of K1,m x K2, Acta Ciencia Indica, Vol XXXII M, No.3 (2006), 1341- 1356.
[7] S.G. Telang, Number Theory, Tata Mcgraw-Hill Publishing Company, pp 660.

Keywords
Ascending Subgraph Decomposition , cartesian product.