Affordable Access

Sunlet Decomposition of Certain Equipartite Graphs

International Journal of Combinatorics
Publication Date
  • Mathematics


Let stand for the sunlet graph which is a graph that consists of a cycle and an edge terminating in a vertex of degree one attached to each vertex of cycle . The necessary condition for the equipartite graph to be decomposed into for is that the order of must divide , the order of . In this work, we show that this condition is sufficient for the decomposition. The proofs are constructive using graph theory techniques.

There are no comments yet on this publication. Be the first to share your thoughts.