Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper we define smooth graceful labeling and we prove that cycle n C , complete bipartite graph n K 2, and path n P are… Expand
  • figure 2
2012
2012
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… Expand
2011
2011
This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree… Expand
2011
2011
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… Expand
2010
2010
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Review
2007
Review
2007
It is easily shown that every path has a graceful labelling, however, in this paper we show that given almost any path P with n… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
2006
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be… Expand
  • table 3
  • table 2
  • table 1
2006
2006
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… Expand
  • figure 1
2002
2002
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1998
1998
We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit… Expand