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
2014
2014
Generalized edge-magic total labellings of models from researching networks
2012
2012
Nowhere-zero modular edge-graceful graphs
For a connected graph G of order n ≥ 3, let f : E(G) → Zn be an edge labeling of G. The vertex labeling f ′ : V (G) → Zn induced… 
2011
2011
Graceful Labelling: State of the Art, Applications and Future Directions
This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree… 
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… 
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… 
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… 
2002
2002
Relaxed Graceful Labellings of Trees
A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the… 
1998
1998
Graceful and harmonious labellings of trees
We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit… 
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)