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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
For a graph G = (V,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is called (a, d)-edge-antimagic… (More)
  • figure 2
  • figure 3
Is this relevant?
2015
2015
A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such… (More)
Is this relevant?
2015
2015
A (p, q) graph G is edge magic graceful if there exists a bijection f : V (G)∪E(G)→ {1, 2, . . . , p+ q} such that |f(u) + f(v… (More)
  • figure 2
Is this relevant?
2014
2014
For any n, we denote the graph Kn,n K1 by G. In this paper we independently show that for any positive integer n ≥ 2 the… (More)
  • figure 1
Is this relevant?
2013
2013
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph ofBn,n and the splitting graph of star K1,n are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We introduce a generalization of the well known concept of a graceful labeling. Given a graph Γ with e = d · m edges, we call d… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
In this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful. 
Is this relevant?
Review
2012
Review
2012
Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a… (More)
  • table 3.1
  • table 3.2
Is this relevant?
2010
2010
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and 1 n − edge is odd graceful, and the cycle graph m C with… (More)
Is this relevant?
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 set {0… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?