Skip to search formSkip to main contentSkip to account menu

Graceful labeling

Known as: Graceful (disambiguation), Von Koch's conjecture, Graceful tree conjecture 
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Butterfly graphEdge-graceful labelingFriendship graphGerhard Ringel

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Super edge magic graceful graphs
2013
2013
GRACEFUL LABELING OF HANGING THETA GRAPHS
In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling. 
2013
2013
Graphs with Edge-Odd Graceful Labelings
Solairaju and Chithra [3] introduced a new type of labeling of a graph G with q edges called an edge-odd graceful lebeling if… 
2011
2011
Super Fibonacci Graceful Labeling
A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n−1)+S(n−2), where S(n) is the Smarandache function… 
2011
2011
Some New Graceful Graphs
In this paper we show that the graphs obtained by duplication of an arbitrary vertex in cycle Cn as well as duplication of an… 
2010
2010
Edge- Odd Gracefulness of Product of P2 and CN
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced… 
2010
2010
Odd Graceful Labeling of Some New Graphs
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle… 
2007
2007
Odd graceful labeling of some union graphs
The union graphs ∪ni=1 Pli , ∪ni=1 Sli , ∪ni=1 Sli ∪∪ti=1 Pmi , Cm∪Pn, Cm∪Cn and ∪ni=1 Cmi, are discussed. It is shown that∪ni=1… 
2006
2006
Efficient enumeration of graceful permutations
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on… 
1982
1982
Construction of Certain Infinite Families of Graceful Graphs form a Given Graceful Graph
Two general methods of constructing an infinite sequence(G=G/sub1/,G/sub2/....) of graceful graphs Gi such that Gi is contained… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)