N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs
| Main Authors: | R. Anitha, R. S. Lekshmi |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2008
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1058671 |
Daftar Isi:
- 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.