N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs

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 nsuns. Keywords—Decomposition, Hamilton cycle, n-sun graph, perfect matching, spanning tree.

10 Figures and Tables

Cite this paper

@inproceedings{Anitha2007NSunDO, title={N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs}, author={R. Anitha and R . S . Lekshmi}, year={2007} }