%0 Journal Article
	%A R. Anitha and  R. S. Lekshmi
	%D 2008
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 19, 2008
	%T N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs
	%U https://publications.waset.org/pdf/3193
	%V 19
	%X 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.
	%P 452 - 457