Two Classes of Graceful Graphs

K.M. Kathiresan1
1Department of Mathematics Ayya Nadar Janaki Ammal College Sivakasi — 626 124 INDIA.

Abstract

In this paper, we prove the gracefulness of a new class of graphs denoted by \(K_{n}\otimes S_{2^{{n-1}}-\binom{n}{2}}\).
We also prove that the graphs consisting of \(2m + 1\) internally disjoint paths of length \(2r\) each, connecting two fixed vertices, are also graceful.