@article{(Open Science Index):https://publications.waset.org/pdf/3193, title = {N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs}, author = {R. Anitha and R. S. Lekshmi}, country = {}, institution = {}, abstract = {Graph decompositions are vital in the study of combinatorial design theory. A decomposition of a graph G is a partition of its edge set. An n-sun graph is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper, we define n-sun decomposition of some even order graphs with a perfect matching. We have proved that the complete graph K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have n-sun decompositions. A labeling scheme is used to construct the n-suns.}, journal = {International Journal of Mathematical and Computational Sciences}, volume = {2}, number = {7}, year = {2008}, pages = {452 - 457}, ee = {https://publications.waset.org/pdf/3193}, url = {https://publications.waset.org/vol/19}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 19, 2008}, }