Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs

Let r be any natural number. An injective function , where  is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that  is bijective. If a graph G admits Gaussian Tribonacci r-graceful labeling, then G is called a Gaussian Tribonacci r-graceful graph. A graph G is said to be Gaussian Tribonacci arbitrarily graceful if it is Gaussian Tribonacci r-graceful for all r. In this paper we investigate the Path graph , the Comb graph , the Coconut tree graph the regular caterpillar graph , the Bistar graph  and the Subdivision of Bistar graph are Gaussian Tribonacci arbitrarily graceful

Lobsters with an almost perfect matching are graceful

Let $T$ be a lobster with a matching that covers all but one vertex. We show that in this case, $T$ is graceful.Comment: 4 page

Polygonal Graceful Labeling of Some Simple Graphs

Let  be a graph with vertices and edges.  Let andbe the vertex set and edge set of respectively.  A polygonal graceful labeling of a graph  is an injective function , where  is a set of all non-negative integers that induces a bijection , where  is the  polygonal number such that for every edge .  A graph which admits such labeling is called a polygonal graceful graph. For , the above labeling gives triangular graceful labeling. For , the above labeling gives tetragonal graceful labeling and so on. In this paper, polygonal graceful labeling is introduced and polygonal graceful labeling of some simple graphs is studie

Some Topics of Special Interest in Graph Theory

Not availabl

Discussion On Some Important Topics in Graph Theory

Not availabl