scholarly journals ODD GRACEFUL LABELING OF PATH UNION OF CATERPILLARS

2021 ◽  
Vol 28 (2) ◽  
pp. 287-294
Author(s):  
J. Jeba Jesintha
Keyword(s):  
Graceful Labeling

Super Graceful Labeling for Some Simple Graphs

2012 ◽  
Vol 2 (1) ◽  
pp. 35 ◽  
Author(s):  
M. A. Perumal ◽  
S. Navaneethakrishnan ◽  
A. Nagaraja ◽  
S. Arockiaraj
Keyword(s):  
Graceful Labeling ◽  
Simple Graphs

Graceful Labeling for Some Complete Bipartite Graph

2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Graceful Labeling

G-GRACEFUL LABELING OF GRAPHS

2020 ◽  
Vol 9 (4) ◽  
pp. 1973-1981
Author(s):  
A. Kumar ◽  
V. Kumar ◽  
K. Kumar ◽  
P. Gupta ◽  
Y. Khandelwal
Keyword(s):  
Graceful Labeling

scholarly journals Edge even graceful labeling of some corona graphs

2021 ◽  
Vol 1872 (1) ◽  
pp. 012007
Author(s):  
D Jayantara ◽  
Purwanto ◽  
S Irawati
Keyword(s):  
Graceful Labeling ◽  
Corona Graphs

scholarly journals Infinitely many equivalent versions of the graceful tree conjecture

2015 ◽  
Vol 9 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Tao-Ming Wang ◽  
Cheng-Chang Yang ◽  
Lih-Hsing Hsu ◽  
Eddie Cheng
Keyword(s):  
Perfect Matching ◽  
Absolute Difference ◽  
Extra Condition ◽  
Graceful Labeling ◽  
The Absolute

A graceful labeling of a graph with q edges is a labeling of its vertices using the integers in [0, q], such that no two vertices are assigned the same label and each edge is uniquely identified by the absolute difference between the labels of its endpoints. The well known Graceful Tree Conjecture (GTC) states that all trees are graceful, and it remains open. It was proved in 1999 by Broersma and Hoede that there is an equivalent conjecture for GTC stating that all trees containing a perfect matching are strongly graceful (graceful with an extra condition). In this paper we extend the above result by showing that there exist infinitely many equivalent versions of the GTC. Moreover we verify these infinitely many equivalent conjectures of GTC for trees of diameter at most 7. Among others we are also able to identify new graceful trees and in particular generalize the ?-construction of Stanton-Zarnke (and later Koh- Rogers-Tan) for building graceful trees through two smaller given graceful trees.

Graceful labeling on twig diamond graph with pendant edges*

2020 ◽  
Vol 39e (2) ◽  
pp. 188-192
Author(s):  
J. Jeba Jesintha ◽  
K. Subashini ◽  
Allu Merin Sabu
Keyword(s):  
Graceful Labeling
Sign in / Sign up

Export Citation Format

Share Document